Base | Representation |
---|---|
bin | 1100001110101100001… |
… | …11000110001010110101 |
3 | 1111011121201222112101110 |
4 | 12013112013012022311 |
5 | 23341034211342323 |
6 | 521012234145233 |
7 | 42234022112466 |
oct | 6072607061265 |
9 | 1434551875343 |
10 | 420204012213 |
11 | 152231234857 |
12 | 69531582219 |
13 | 3081837655b |
14 | 164a35d2d6d |
15 | ade5512793 |
hex | 61d61c62b5 |
420204012213 has 8 divisors (see below), whose sum is σ = 560328415776. Its totient is φ = 280107808400.
The previous prime is 420204012211. The next prime is 420204012223. The reversal of 420204012213 is 312210402024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 420204012213 - 21 = 420204012211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 420204012213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420204012211) 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 in 7 ways as a sum of consecutive naturals, for example, 7015143 + ... + 7074788.
It is an arithmetic number, because the mean of its divisors is an integer number (70041051972).
Almost surely, 2420204012213 is an apocalyptic number.
It is an amenable number.
420204012213 is a deficient number, since it is larger than the sum of its proper divisors (140124403563).
420204012213 is a wasteful number, since it uses less digits than its factorization.
420204012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14099875.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 420204012213 its reverse (312210402024), we get a palindrome (732414414237).
The spelling of 420204012213 in words is "four hundred twenty billion, two hundred four million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •