Base | Representation |
---|---|
bin | 111000010000011001… |
… | …1001110100111010001 |
3 | 102112211102011121011111 |
4 | 1300200303032213101 |
5 | 3434404200300101 |
6 | 131255444213321 |
7 | 11504524552456 |
oct | 1604063164721 |
9 | 375742147144 |
10 | 120809384401 |
11 | 47264825652 |
12 | 1b4b699a241 |
13 | b513aa4854 |
14 | 5bc0a3582d |
15 | 3221083251 |
hex | 1c20cce9d1 |
120809384401 has 2 divisors, whose sum is σ = 120809384402. Its totient is φ = 120809384400.
The previous prime is 120809384359. The next prime is 120809384441. The reversal of 120809384401 is 104483908021.
It is an a-pointer prime, because the next prime (120809384441) can be obtained adding 120809384401 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83868160000 + 36941224401 = 289600^2 + 192201^2 .
It is an emirp because it is prime and its reverse (104483908021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120809384401 - 29 = 120809383889 is a prime.
It is not a weakly prime, because it can be changed into another prime (120809384441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60404692200 + 60404692201.
It is an arithmetic number, because the mean of its divisors is an integer number (60404692201).
Almost surely, 2120809384401 is an apocalyptic number.
It is an amenable number.
120809384401 is a deficient number, since it is larger than the sum of its proper divisors (1).
120809384401 is an equidigital number, since it uses as much as digits as its factorization.
120809384401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 40.
The spelling of 120809384401 in words is "one hundred twenty billion, eight hundred nine million, three hundred eighty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •