Base | Representation |
---|---|
bin | 1100001110100000000… |
… | …01111111010010100101 |
3 | 1111011100122001021200111 |
4 | 12013100001333102211 |
5 | 23340332103310041 |
6 | 520554152013021 |
7 | 42231343111141 |
oct | 6072001772245 |
9 | 1434318037614 |
10 | 420102010021 |
11 | 1521896a6021 |
12 | 69503391171 |
13 | 308001b1625 |
14 | 16493c40221 |
15 | addb5b4981 |
hex | 61d007f4a5 |
420102010021 has 4 divisors (see below), whose sum is σ = 420349276000. Its totient is φ = 419854744044.
The previous prime is 420102010001. The next prime is 420102010043. The reversal of 420102010021 is 120010201024.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 420102010021 - 25 = 420102009989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420102009983 and 420102010010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420102010001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123630441 + ... + 123633838.
It is an arithmetic number, because the mean of its divisors is an integer number (105087319000).
Almost surely, 2420102010021 is an apocalyptic number.
It is an amenable number.
420102010021 is a deficient number, since it is larger than the sum of its proper divisors (247265979).
420102010021 is a wasteful number, since it uses less digits than its factorization.
420102010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247265978.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 420102010021 its reverse (120010201024), we get a palindrome (540112211045).
The spelling of 420102010021 in words is "four hundred twenty billion, one hundred two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •