5758
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 2882
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2878
- Möbius Function
- 1
- Radical
- 5758
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T2 for Zeolite Code MTT.at n=47A008190
- a(n) = b(n) - c(n) where b(n) is the n-th Lucas number greater than 3 and c(n) is the n-th number not in sequence b( ).at n=15A014252
- a(n) = T(n,0) + T(n,1) + ... + T(n,2n), T given by A027113.at n=8A027115
- Pair up the numbers.at n=28A030655
- [ exp(2/15)*n! ].at n=6A030914
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 74.at n=21A031572
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=10A031818
- T(n,n+1), array T as in A047060.at n=8A047066
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=30A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=30A051861
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=1A061364
- a(2n) = concatenation of 4n+1 and 4n+2, a(2n+1) = concatenation of the two most nearly equal numbers whose product is a(2n).at n=28A068517
- Smallest initial value k that reaches 1 in n steps when iterating the map m -> rad(m)-1, where rad(m) is the squarefree kernel of m (A007947).at n=17A075426
- Partition the concatenation 1234567...of natural numbers into successive strings which are even, all different and > 2. (0 never taken as the most significant digit.)at n=35A077295
- Nontrivial slowest increasing sequence whose succession of digits is that of the nonnegative integers.at n=29A098080
- Positions of records in A064097.at n=20A105017
- Semiprimes (A001358) whose digit reversal is a powerful(1) number (A001694).at n=22A115688
- a(n) = floor(((1+sqrt(2))/2)^n).at n=45A125894
- Numbers n such that (5+n!)/5 is prime.at n=17A139058
- Ulam's spiral (NNW spoke).at n=19A143860