Base | Representation |
---|---|
bin | 101111110000101101000100… |
… | …1000010110100110001110010 |
3 | 2001002111010221021111120002201 |
4 | 1133201122021002310301302 |
5 | 420031041222424410002 |
6 | 4045255550411133414 |
7 | 154326651100101361 |
oct | 13741321102646162 |
9 | 2032433837446081 |
10 | 420110230310002 |
11 | 111950825839091 |
12 | 3b15021614426a |
13 | 150552bc968a9b |
14 | 75a562d4bb7d8 |
15 | 3388070402087 |
hex | 17e16890b4c72 |
420110230310002 has 8 divisors (see below), whose sum is σ = 663331942594800. Its totient is φ = 198999582778404.
The previous prime is 420110230309981. The next prime is 420110230310033. The reversal of 420110230310002 is 200013032011024.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×4201102303100022 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 5527766188252 + ... + 5527766188327.
It is an arithmetic number, because the mean of its divisors is an integer number (82916492824350).
Almost surely, 2420110230310002 is an apocalyptic number.
420110230310002 is a deficient number, since it is larger than the sum of its proper divisors (243221712284798).
420110230310002 is a wasteful number, since it uses less digits than its factorization.
420110230310002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11055532376600.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 420110230310002 its reverse (200013032011024), we get a palindrome (620123262321026).
The spelling of 420110230310002 in words is "four hundred twenty trillion, one hundred ten billion, two hundred thirty million, three hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •