Base | Representation |
---|---|
bin | 110111111100001101… |
… | …1001110001000010001 |
3 | 102111002012120000122022 |
4 | 1233320123032020101 |
5 | 3432012243033241 |
6 | 131104325421225 |
7 | 11451661112552 |
oct | 1577033161021 |
9 | 374065500568 |
10 | 120132002321 |
11 | 46a47424451 |
12 | 1b347b6a815 |
13 | b436654356 |
14 | 5b58aa8329 |
15 | 31d187c54b |
hex | 1bf86ce211 |
120132002321 has 2 divisors, whose sum is σ = 120132002322. Its totient is φ = 120132002320.
The previous prime is 120132002281. The next prime is 120132002357. The reversal of 120132002321 is 123200231021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119951395600 + 180606721 = 346340^2 + 13439^2 .
It is a cyclic number.
It is not a de Polignac number, because 120132002321 - 214 = 120131985937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120132002321.
It is not a weakly prime, because it can be changed into another prime (120132002381) 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, 60066001160 + 60066001161.
It is an arithmetic number, because the mean of its divisors is an integer number (60066001161).
Almost surely, 2120132002321 is an apocalyptic number.
It is an amenable number.
120132002321 is a deficient number, since it is larger than the sum of its proper divisors (1).
120132002321 is an equidigital number, since it uses as much as digits as its factorization.
120132002321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 120132002321 its reverse (123200231021), we get a palindrome (243332233342).
The spelling of 120132002321 in words is "one hundred twenty billion, one hundred thirty-two million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •