Base | Representation |
---|---|
bin | 1001100110011100001100… |
… | …1110011110111010101110 |
3 | 1101101010220111010202212001 |
4 | 2121213003032132322232 |
5 | 2340422202030000141 |
6 | 34241210345002514 |
7 | 2136434524354510 |
oct | 231470316367256 |
9 | 41333814122761 |
10 | 10556010000046 |
11 | 33aa8624a5555 |
12 | 12259aa48343a |
13 | 5b7573203654 |
14 | 286cb0d35bb0 |
15 | 1348bcd7ba31 |
hex | 999c339eeae |
10556010000046 has 8 divisors (see below), whose sum is σ = 18096017142960. Its totient is φ = 4524004285728.
The previous prime is 10556010000031. The next prime is 10556010000061. The reversal of 10556010000046 is 64000001065501.
It is an interprime number because it is at equal distance from previous prime (10556010000031) and next prime (10556010000061).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×105560100000462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10556009999969 and 10556010000023.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 377000357131 + ... + 377000357158.
It is an arithmetic number, because the mean of its divisors is an integer number (2262002142870).
Almost surely, 210556010000046 is an apocalyptic number.
10556010000046 is a deficient number, since it is larger than the sum of its proper divisors (7540007142914).
10556010000046 is an equidigital number, since it uses as much as digits as its factorization.
10556010000046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754000714298.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 10556010000046 its reverse (64000001065501), we get a palindrome (74556011065547).
The spelling of 10556010000046 in words is "ten trillion, five hundred fifty-six billion, ten million, forty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •