Base | Representation |
---|---|
bin | 11011010010101100101100… |
… | …101001001111101100111001 |
3 | 120201222222002101211002112102 |
4 | 123102230230221033230321 |
5 | 111213101421201443113 |
6 | 1103142010443153145 |
7 | 34166016546011513 |
oct | 3322545451175471 |
9 | 521888071732472 |
10 | 120032200031033 |
11 | 35278408759104 |
12 | 11567064b157b5 |
13 | 51c8cac534584 |
14 | 218d837762bb3 |
15 | dd24a64a5758 |
hex | 6d2b2ca4fb39 |
120032200031033 has 2 divisors, whose sum is σ = 120032200031034. Its totient is φ = 120032200031032.
The previous prime is 120032200030993. The next prime is 120032200031039. The reversal of 120032200031033 is 330130002230021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69456022704784 + 50576177326249 = 8334028^2 + 7111693^2 .
It is a cyclic number.
It is not a de Polignac number, because 120032200031033 - 220 = 120032198982457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120032200030996 and 120032200031014.
It is not a weakly prime, because it can be changed into another prime (120032200031039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60016100015516 + 60016100015517.
It is an arithmetic number, because the mean of its divisors is an integer number (60016100015517).
Almost surely, 2120032200031033 is an apocalyptic number.
It is an amenable number.
120032200031033 is a deficient number, since it is larger than the sum of its proper divisors (1).
120032200031033 is an equidigital number, since it uses as much as digits as its factorization.
120032200031033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 120032200031033 its reverse (330130002230021), we get a palindrome (450162202261054).
The spelling of 120032200031033 in words is "one hundred twenty trillion, thirty-two billion, two hundred million, thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •