Base | Representation |
---|---|
bin | 1001001000100010001001… |
… | …1111001111011100100011 |
3 | 1022120000201000211210221000 |
4 | 2102020202133033130203 |
5 | 2304012422302344443 |
6 | 33205154550003043 |
7 | 2054345243622153 |
oct | 222104237173443 |
9 | 38500630753830 |
10 | 10042212153123 |
11 | 3221972a62487 |
12 | 11622b8646483 |
13 | 57ac90606017 |
14 | 26a08d41c763 |
15 | 12634ac478d3 |
hex | 922227cf723 |
10042212153123 has 16 divisors (see below), whose sum is σ = 15524192701440. Its totient is φ = 6403729488552.
The previous prime is 10042212153091. The next prime is 10042212153131. The reversal of 10042212153123 is 32135121224001.
It is a happy number.
10042212153123 is a `hidden beast` number, since 1 + 0 + 0 + 4 + 2 + 2 + 121 + 531 + 2 + 3 = 666.
It is not a de Polignac number, because 10042212153123 - 25 = 10042212153091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10042212153023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8085516411 + ... + 8085517652.
It is an arithmetic number, because the mean of its divisors is an integer number (970262043840).
Almost surely, 210042212153123 is an apocalyptic number.
10042212153123 is a deficient number, since it is larger than the sum of its proper divisors (5481980548317).
10042212153123 is a wasteful number, since it uses less digits than its factorization.
10042212153123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16171034095 (or 16171034089 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 10042212153123 its reverse (32135121224001), we get a palindrome (42177333377124).
The spelling of 10042212153123 in words is "ten trillion, forty-two billion, two hundred twelve million, one hundred fifty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •