Base | Representation |
---|---|
bin | 111000000100010101… |
… | …0001001100101000001 |
3 | 102111210012000210012102 |
4 | 1300020222021211001 |
5 | 3433042003220142 |
6 | 131151335040145 |
7 | 11461506046106 |
oct | 1601052114501 |
9 | 374705023172 |
10 | 120404351297 |
11 | 4707713224a |
12 | 1b403210055 |
13 | b47abc03a9 |
14 | 5b82d20aad |
15 | 31ea728532 |
hex | 1c08a89941 |
120404351297 has 2 divisors, whose sum is σ = 120404351298. Its totient is φ = 120404351296.
The previous prime is 120404351281. The next prime is 120404351339. The reversal of 120404351297 is 792153404021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105333351601 + 15070999696 = 324551^2 + 122764^2 .
It is a cyclic number.
It is not a de Polignac number, because 120404351297 - 24 = 120404351281 is a prime.
It is a super-2 number, since 2×1204043512972 (a number of 23 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 120404351297.
It is not a weakly prime, because it can be changed into another prime (120404351227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60202175648 + 60202175649.
It is an arithmetic number, because the mean of its divisors is an integer number (60202175649).
Almost surely, 2120404351297 is an apocalyptic number.
It is an amenable number.
120404351297 is a deficient number, since it is larger than the sum of its proper divisors (1).
120404351297 is an equidigital number, since it uses as much as digits as its factorization.
120404351297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 120404351297 in words is "one hundred twenty billion, four hundred four million, three hundred fifty-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •