Base | Representation |
---|---|
bin | 1001001101001000001111… |
… | …1010010111111011101011 |
3 | 1022211120110202202011012000 |
4 | 2103102003322113323223 |
5 | 2311311111423121201 |
6 | 33305332300022043 |
7 | 2063141453046501 |
oct | 223220372277353 |
9 | 38746422664160 |
10 | 10121156067051 |
11 | 32523a3818457 |
12 | 117566a831923 |
13 | 5855619c4323 |
14 | 26dc1bc0a671 |
15 | 12841b656d86 |
hex | 93483e97eeb |
10121156067051 has 8 divisors (see below), whose sum is σ = 14994305284560. Its totient is φ = 6747437378016.
The previous prime is 10121156067049. The next prime is 10121156067103. The reversal of 10121156067051 is 15076065112101.
10121156067051 is a `hidden beast` number, since 1 + 0 + 1 + 21 + 1 + 560 + 6 + 70 + 5 + 1 = 666.
It is not a de Polignac number, because 10121156067051 - 21 = 10121156067049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10121156066997 and 10121156067015.
It is not an unprimeable number, because it can be changed into a prime (10121156067851) 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, 187428816030 + ... + 187428816083.
It is an arithmetic number, because the mean of its divisors is an integer number (1874288160570).
Almost surely, 210121156067051 is an apocalyptic number.
10121156067051 is a deficient number, since it is larger than the sum of its proper divisors (4873149217509).
10121156067051 is an equidigital number, since it uses as much as digits as its factorization.
10121156067051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374857632122 (or 374857632116 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 36.
The spelling of 10121156067051 in words is "ten trillion, one hundred twenty-one billion, one hundred fifty-six million, sixty-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •