Base | Representation |
---|---|
bin | 11011010011110101001010… |
… | …011111000110110110100001 |
3 | 120202021101221010012012111022 |
4 | 123103311022133012312201 |
5 | 111220340300041214103 |
6 | 1103241435451055225 |
7 | 34204443006465062 |
oct | 3323651237066641 |
9 | 522241833165438 |
10 | 120110010101153 |
11 | 352a8407493486 |
12 | 1157a15b441515 |
13 | 520342ca52497 |
14 | 21934d9722569 |
15 | dd450c596138 |
hex | 6d3d4a7c6da1 |
120110010101153 has 2 divisors, whose sum is σ = 120110010101154. Its totient is φ = 120110010101152.
The previous prime is 120110010101087. The next prime is 120110010101197. The reversal of 120110010101153 is 351101010011021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114203248574464 + 5906761526689 = 10686592^2 + 2430383^2 .
It is a cyclic number.
It is not a de Polignac number, because 120110010101153 - 238 = 119835132194209 is a prime.
It is a super-3 number, since 3×1201100101011533 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (120110010101353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055005050576 + 60055005050577.
It is an arithmetic number, because the mean of its divisors is an integer number (60055005050577).
Almost surely, 2120110010101153 is an apocalyptic number.
It is an amenable number.
120110010101153 is a deficient number, since it is larger than the sum of its proper divisors (1).
120110010101153 is an equidigital number, since it uses as much as digits as its factorization.
120110010101153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 120110010101153 its reverse (351101010011021), we get a palindrome (471211020112174).
The spelling of 120110010101153 in words is "one hundred twenty trillion, one hundred ten billion, ten million, one hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •