Base | Representation |
---|---|
bin | 1001000111010011001001… |
… | …0100011110011110101101 |
3 | 1022110222221220221122112010 |
4 | 2101310302110132132231 |
5 | 2303141003222230333 |
6 | 33151330222431433 |
7 | 2052664536324531 |
oct | 221646224363655 |
9 | 38428856848463 |
10 | 10021002930093 |
11 | 32139799a8291 |
12 | 115a179732579 |
13 | 578c90557bcc |
14 | 26903a6c5bc1 |
15 | 125a08c6d563 |
hex | 91d3251e7ad |
10021002930093 has 64 divisors (see below), whose sum is σ = 14503572576000. Its totient is φ = 6135400857600.
The previous prime is 10021002929953. The next prime is 10021002930097. The reversal of 10021002930093 is 39003920012001.
It is a happy number.
It is not a de Polignac number, because 10021002930093 - 214 = 10021002913709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10021002930093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021002930097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57488733 + ... + 57662781.
It is an arithmetic number, because the mean of its divisors is an integer number (226618321500).
Almost surely, 210021002930093 is an apocalyptic number.
It is an amenable number.
10021002930093 is a deficient number, since it is larger than the sum of its proper divisors (4482569645907).
10021002930093 is a wasteful number, since it uses less digits than its factorization.
10021002930093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174382.
The product of its (nonzero) digits is 2916, while the sum is 30.
Adding to 10021002930093 its reverse (39003920012001), we get a palindrome (49024922942094).
The spelling of 10021002930093 in words is "ten trillion, twenty-one billion, two million, nine hundred thirty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •