Base | Representation |
---|---|
bin | 11011010110111010111001… |
… | …110000001000001000100011 |
3 | 120210000200222001222100101102 |
4 | 123112322321300020020203 |
5 | 111232330113014400311 |
6 | 1103523152044225015 |
7 | 34226000340016004 |
oct | 3326727160101043 |
9 | 523020861870342 |
10 | 120322330231331 |
11 | 3537a460689848 |
12 | 115b3334b3b16b |
13 | 521a4686316c7 |
14 | 219d8bbb551ab |
15 | dd9cd742443b |
hex | 6d6eb9c08223 |
120322330231331 has 2 divisors, whose sum is σ = 120322330231332. Its totient is φ = 120322330231330.
The previous prime is 120322330231277. The next prime is 120322330231343. The reversal of 120322330231331 is 133132033223021.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120322330231331 is a prime.
It is a super-2 number, since 2×1203223302313312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120322330231294 and 120322330231303.
It is not a weakly prime, because it can be changed into another prime (120322330234331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60161165115665 + 60161165115666.
It is an arithmetic number, because the mean of its divisors is an integer number (60161165115666).
Almost surely, 2120322330231331 is an apocalyptic number.
120322330231331 is a deficient number, since it is larger than the sum of its proper divisors (1).
120322330231331 is an equidigital number, since it uses as much as digits as its factorization.
120322330231331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 120322330231331 its reverse (133132033223021), we get a palindrome (253454363454352).
The spelling of 120322330231331 in words is "one hundred twenty trillion, three hundred twenty-two billion, three hundred thirty million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •