Base | Representation |
---|---|
bin | 1100001110011011010… |
… | …11110000000011100101 |
3 | 1111011020212221100222211 |
4 | 12013031223300003211 |
5 | 23340242013013041 |
6 | 520550223523421 |
7 | 42230354260033 |
oct | 6071553600345 |
9 | 1434225840884 |
10 | 420062626021 |
11 | 152169446265 |
12 | 694b2159571 |
13 | 307c4ca229c |
14 | 1648c90b553 |
15 | add7dd5481 |
hex | 61cdaf00e5 |
420062626021 has 8 divisors (see below), whose sum is σ = 434224640000. Its totient is φ = 405938837520.
The previous prime is 420062626013. The next prime is 420062626117. The reversal of 420062626021 is 120626260024.
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 420062626021 - 23 = 420062626013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420062626421) 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, 9534021 + ... + 9577978.
It is an arithmetic number, because the mean of its divisors is an integer number (54278080000).
Almost surely, 2420062626021 is an apocalyptic number.
It is an amenable number.
420062626021 is a deficient number, since it is larger than the sum of its proper divisors (14162013979).
420062626021 is a wasteful number, since it uses less digits than its factorization.
420062626021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19112739.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 420062626021 its reverse (120626260024), we get a palindrome (540688886045).
The spelling of 420062626021 in words is "four hundred twenty billion, sixty-two million, six hundred twenty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •