Base | Representation |
---|---|
bin | 1001001100100110100110… |
… | …0000110110001110000001 |
3 | 1022210201011020212122112101 |
4 | 2103021221200312032001 |
5 | 2311134112021430103 |
6 | 33301240103030401 |
7 | 2062401561165004 |
oct | 223115140661601 |
9 | 38721136778471 |
10 | 10112123233153 |
11 | 3249588a40677 |
12 | 117396973b401 |
13 | 5847524b91b6 |
14 | 26d6022c953b |
15 | 12808d641a1d |
hex | 93269836381 |
10112123233153 has 2 divisors, whose sum is σ = 10112123233154. Its totient is φ = 10112123233152.
The previous prime is 10112123233103. The next prime is 10112123233229. The reversal of 10112123233153 is 35133232121101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10015655221504 + 96468011649 = 3164752^2 + 310593^2 .
It is an emirp because it is prime and its reverse (35133232121101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10112123233153 - 29 = 10112123232641 is a prime.
It is not a weakly prime, because it can be changed into another prime (10112123233103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056061616576 + 5056061616577.
It is an arithmetic number, because the mean of its divisors is an integer number (5056061616577).
Almost surely, 210112123233153 is an apocalyptic number.
It is an amenable number.
10112123233153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112123233153 is an equidigital number, since it uses as much as digits as its factorization.
10112123233153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 10112123233153 its reverse (35133232121101), we get a palindrome (45245355354254).
The spelling of 10112123233153 in words is "ten trillion, one hundred twelve billion, one hundred twenty-three million, two hundred thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •