Base | Representation |
---|---|
bin | 10011101010100110… |
… | …01001110100000111 |
3 | 1000020210112101001112 |
4 | 21311103021310013 |
5 | 133110304433144 |
6 | 4503352115235 |
7 | 522430403552 |
oct | 116523116407 |
9 | 30223471045 |
10 | 10557889799 |
11 | 4528720966 |
12 | 2067995b1b |
13 | cc3460b92 |
14 | 7222a7699 |
15 | 41bd5d99e |
hex | 2754c9d07 |
10557889799 has 8 divisors (see below), whose sum is σ = 10629456768. Its totient is φ = 10486422520.
The previous prime is 10557889781. The next prime is 10557889807. The reversal of 10557889799 is 99798875501.
10557889799 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10557889799 - 220 = 10556841223 is a prime.
It is a super-2 number, since 2×105578897992 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10557889399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194084 + ... + 242454.
It is an arithmetic number, because the mean of its divisors is an integer number (1328682096).
Almost surely, 210557889799 is an apocalyptic number.
10557889799 is a deficient number, since it is larger than the sum of its proper divisors (71566969).
10557889799 is a wasteful number, since it uses less digits than its factorization.
10557889799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49845.
The product of its (nonzero) digits is 57153600, while the sum is 68.
The spelling of 10557889799 in words is "ten billion, five hundred fifty-seven million, eight hundred eighty-nine thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •