Base | Representation |
---|---|
bin | 1111010110010010… |
… | …1010101101000101 |
3 | 101122010120012200111 |
4 | 3311210222231011 |
5 | 31414211430041 |
6 | 1520454313021 |
7 | 204045451222 |
oct | 36544525505 |
9 | 11563505614 |
10 | 4120030021 |
11 | 1824716598 |
12 | 96b958771 |
13 | 5087591b3 |
14 | 2b127a949 |
15 | 191a84981 |
hex | f592ab45 |
4120030021 has 2 divisors, whose sum is σ = 4120030022. Its totient is φ = 4120030020.
The previous prime is 4120029959. The next prime is 4120030027. The reversal of 4120030021 is 1200300214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4051322500 + 68707521 = 63650^2 + 8289^2 .
It is a cyclic number.
It is not a de Polignac number, because 4120030021 - 215 = 4119997253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4120029983 and 4120030010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4120030027) 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, 2060015010 + 2060015011.
It is an arithmetic number, because the mean of its divisors is an integer number (2060015011).
Almost surely, 24120030021 is an apocalyptic number.
It is an amenable number.
4120030021 is a deficient number, since it is larger than the sum of its proper divisors (1).
4120030021 is an equidigital number, since it uses as much as digits as its factorization.
4120030021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 4120030021 is about 64187.4599980401. The cubic root of 4120030021 is about 1603.1228100549.
Adding to 4120030021 its reverse (1200300214), we get a palindrome (5320330235).
The spelling of 4120030021 in words is "four billion, one hundred twenty million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •