Base | Representation |
---|---|
bin | 1001000110001001011111… |
… | …0000101111101110100001 |
3 | 1022102002220220200212212221 |
4 | 2101202113300233232201 |
5 | 2302330004340044410 |
6 | 33134300204151041 |
7 | 2051364542243215 |
oct | 221422760575641 |
9 | 38362826625787 |
10 | 10001230003105 |
11 | 3206552672610 |
12 | 115637b838481 |
13 | 57715bc26203 |
14 | 2680c262c945 |
15 | 12524ce084da |
hex | 91897c2fba1 |
10001230003105 has 8 divisors (see below), whose sum is σ = 13092519276864. Its totient is φ = 7273621820400.
The previous prime is 10001230003091. The next prime is 10001230003109. The reversal of 10001230003105 is 50130003210001.
10001230003105 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 not a de Polignac number, because 10001230003105 - 237 = 9863791049633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10001230003109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90920272701 + ... + 90920272810.
It is an arithmetic number, because the mean of its divisors is an integer number (1636564909608).
Almost surely, 210001230003105 is an apocalyptic number.
It is an amenable number.
10001230003105 is a deficient number, since it is larger than the sum of its proper divisors (3091289273759).
10001230003105 is a wasteful number, since it uses less digits than its factorization.
10001230003105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181840545527.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 10001230003105 its reverse (50130003210001), we get a palindrome (60131233213106).
The spelling of 10001230003105 in words is "ten trillion, one billion, two hundred thirty million, three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •