Base | Representation |
---|---|
bin | 1001000110010111100011… |
… | …0101011100111101000001 |
3 | 1022102110200002010000110110 |
4 | 2101211320311130331001 |
5 | 2302410223031014104 |
6 | 33140123015221533 |
7 | 2051560243521603 |
oct | 221457065347501 |
9 | 38373602100413 |
10 | 10005006110529 |
11 | 3208110134a51 |
12 | 11570543778a9 |
13 | 5776113464c1 |
14 | 26835dd41173 |
15 | 1253be6a4e89 |
hex | 91978d5cf41 |
10005006110529 has 8 divisors (see below), whose sum is σ = 13340282765472. Its totient is φ = 6669866764640.
The previous prime is 10005006110483. The next prime is 10005006110581. The reversal of 10005006110529 is 92501160050001.
10005006110529 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 10005006110529 - 28 = 10005006110273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10005006110496 and 10005006110505.
It is not an unprimeable number, because it can be changed into a prime (10005006110129) 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, 34157124 + ... + 34448789.
It is an arithmetic number, because the mean of its divisors is an integer number (1667535345684).
Almost surely, 210005006110529 is an apocalyptic number.
It is an amenable number.
10005006110529 is a deficient number, since it is larger than the sum of its proper divisors (3335276654943).
10005006110529 is an equidigital number, since it uses as much as digits as its factorization.
10005006110529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68654527.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 10005006110529 in words is "ten trillion, five billion, six million, one hundred ten thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •