Base | Representation |
---|---|
bin | 110001110001001001001… |
… | …000111010010001101101 |
3 | 110002221200010221212110201 |
4 | 301301021020322101231 |
5 | 422013200341241422 |
6 | 11135045212033501 |
7 | 502042211122564 |
oct | 61611110722155 |
9 | 13087603855421 |
10 | 3420021040237 |
11 | 10a9471798a1a |
12 | 4729a6162891 |
13 | 1ba6780018c9 |
14 | bb75c09abdb |
15 | 5de68b62727 |
hex | 31c4923a46d |
3420021040237 has 2 divisors, whose sum is σ = 3420021040238. Its totient is φ = 3420021040236.
The previous prime is 3420021040229. The next prime is 3420021040309. The reversal of 3420021040237 is 7320401200243.
3420021040237 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2288884564836 + 1131136475401 = 1512906^2 + 1063549^2 .
It is a cyclic number.
It is not a de Polignac number, because 3420021040237 - 23 = 3420021040229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3420021040537) 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, 1710010520118 + 1710010520119.
It is an arithmetic number, because the mean of its divisors is an integer number (1710010520119).
Almost surely, 23420021040237 is an apocalyptic number.
It is an amenable number.
3420021040237 is a deficient number, since it is larger than the sum of its proper divisors (1).
3420021040237 is an equidigital number, since it uses as much as digits as its factorization.
3420021040237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 28.
The spelling of 3420021040237 in words is "three trillion, four hundred twenty billion, twenty-one million, forty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •