Base | Representation |
---|---|
bin | 110111111000111010… |
… | …1011001011110010101 |
3 | 102110210111111001201201 |
4 | 1233301311121132111 |
5 | 3431300441032041 |
6 | 131045335352501 |
7 | 11446146162052 |
oct | 1576165313625 |
9 | 373714431651 |
10 | 120021424021 |
11 | 4699aa68324 |
12 | 1b316b22731 |
13 | b4197789c5 |
14 | 5b48122029 |
15 | 31c6cd8631 |
hex | 1bf1d59795 |
120021424021 has 2 divisors, whose sum is σ = 120021424022. Its totient is φ = 120021424020.
The previous prime is 120021423989. The next prime is 120021424079. The reversal of 120021424021 is 120424120021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80505550225 + 39515873796 = 283735^2 + 198786^2 .
It is a cyclic number.
It is not a de Polignac number, because 120021424021 - 25 = 120021423989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120021424021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120021424321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60010712010 + 60010712011.
It is an arithmetic number, because the mean of its divisors is an integer number (60010712011).
Almost surely, 2120021424021 is an apocalyptic number.
It is an amenable number.
120021424021 is a deficient number, since it is larger than the sum of its proper divisors (1).
120021424021 is an equidigital number, since it uses as much as digits as its factorization.
120021424021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 120021424021 its reverse (120424120021), we get a palindrome (240445544042).
The spelling of 120021424021 in words is "one hundred twenty billion, twenty-one million, four hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •