Base | Representation |
---|---|
bin | 11011010100000111110010… |
… | …101011010001000110011011 |
3 | 120202100022120001210020112222 |
4 | 123110013302223101012123 |
5 | 111221202231000332311 |
6 | 1103254544315254255 |
7 | 34206051451515551 |
oct | 3324076253210633 |
9 | 522308501706488 |
10 | 120130011730331 |
11 | 35305940925529 |
12 | 11582001a4a38b |
13 | 520529987a815 |
14 | 2194475d0dbd1 |
15 | dd4ccd534adb |
hex | 6d41f2ad119b |
120130011730331 has 2 divisors, whose sum is σ = 120130011730332. Its totient is φ = 120130011730330.
The previous prime is 120130011730259. The next prime is 120130011730343. The reversal of 120130011730331 is 133037110031021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120130011730331 - 210 = 120130011729307 is a prime.
It is a super-2 number, since 2×1201300117303312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 120130011730331.
It is not a weakly prime, because it can be changed into another prime (120130011730031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60065005865165 + 60065005865166.
It is an arithmetic number, because the mean of its divisors is an integer number (60065005865166).
Almost surely, 2120130011730331 is an apocalyptic number.
120130011730331 is a deficient number, since it is larger than the sum of its proper divisors (1).
120130011730331 is an equidigital number, since it uses as much as digits as its factorization.
120130011730331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1134, while the sum is 26.
Adding to 120130011730331 its reverse (133037110031021), we get a palindrome (253167121761352).
The spelling of 120130011730331 in words is "one hundred twenty trillion, one hundred thirty billion, eleven million, seven hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •