Base | Representation |
---|---|
bin | 11011010101100110000010… |
… | …101100001000010001000011 |
3 | 120202200222202220011212020221 |
4 | 123111212002230020101003 |
5 | 111224332010300420303 |
6 | 1103413242323043511 |
7 | 34216263342616666 |
oct | 3325460254102103 |
9 | 522628686155227 |
10 | 120231212123203 |
11 | 35344852905555 |
12 | 11599745810597 |
13 | 52119a6c8b4ac |
14 | 21993165636dd |
15 | dd7752d364bd |
hex | 6d5982b08443 |
120231212123203 has 2 divisors, whose sum is σ = 120231212123204. Its totient is φ = 120231212123202.
The previous prime is 120231212123189. The next prime is 120231212123227. The reversal of 120231212123203 is 302321212132021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120231212123203 - 25 = 120231212123171 is a prime.
It is a super-2 number, since 2×1202312121232032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120231212123273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60115606061601 + 60115606061602.
It is an arithmetic number, because the mean of its divisors is an integer number (60115606061602).
Almost surely, 2120231212123203 is an apocalyptic number.
120231212123203 is a deficient number, since it is larger than the sum of its proper divisors (1).
120231212123203 is an equidigital number, since it uses as much as digits as its factorization.
120231212123203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 120231212123203 its reverse (302321212132021), we get a palindrome (422552424255224).
The spelling of 120231212123203 in words is "one hundred twenty trillion, two hundred thirty-one billion, two hundred twelve million, one hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •