Base | Representation |
---|---|
bin | 111000001000000111… |
… | …1010000101101001011 |
3 | 102112010001022122022122 |
4 | 1300100033100231023 |
5 | 3433322032122311 |
6 | 131212120441455 |
7 | 11464612006235 |
oct | 1602017205513 |
9 | 375101278278 |
10 | 120531520331 |
11 | 471319a0222 |
12 | 1b43991928b |
13 | b49b357441 |
14 | 5b95b85255 |
15 | 32069980db |
hex | 1c103d0b4b |
120531520331 has 2 divisors, whose sum is σ = 120531520332. Its totient is φ = 120531520330.
The previous prime is 120531520301. The next prime is 120531520357. The reversal of 120531520331 is 133025135021.
It is an a-pointer prime, because the next prime (120531520357) can be obtained adding 120531520331 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120531520331 - 214 = 120531503947 is a prime.
It is a super-2 number, since 2×1205315203312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120531520331.
It is not a weakly prime, because it can be changed into another prime (120531520301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60265760165 + 60265760166.
It is an arithmetic number, because the mean of its divisors is an integer number (60265760166).
Almost surely, 2120531520331 is an apocalyptic number.
120531520331 is a deficient number, since it is larger than the sum of its proper divisors (1).
120531520331 is an equidigital number, since it uses as much as digits as its factorization.
120531520331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 120531520331 its reverse (133025135021), we get a palindrome (253556655352).
The spelling of 120531520331 in words is "one hundred twenty billion, five hundred thirty-one million, five hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •