Base | Representation |
---|---|
bin | 1100001110101100100… |
… | …10101110010101011110 |
3 | 1111011121221201101121020 |
4 | 12013112102232111132 |
5 | 23341041001412233 |
6 | 521012423345010 |
7 | 42234060036213 |
oct | 6072622562536 |
9 | 1434557641536 |
10 | 420207060318 |
11 | 152232a26951 |
12 | 695325b2166 |
13 | 30818ba2a76 |
14 | 164a3b87b0a |
15 | ade59159b3 |
hex | 61d64ae55e |
420207060318 has 8 divisors (see below), whose sum is σ = 840414120648. Its totient is φ = 140069020104.
The previous prime is 420207060281. The next prime is 420207060319. The reversal of 420207060318 is 813060702024.
It is a sphenic number, since it is the product of 3 distinct primes.
420207060318 is an admirable number.
It is a super-2 number, since 2×4202070603182 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420207060319) 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, 35017255021 + ... + 35017255032.
It is an arithmetic number, because the mean of its divisors is an integer number (105051765081).
Almost surely, 2420207060318 is an apocalyptic number.
420207060318 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420207060318 is a wasteful number, since it uses less digits than its factorization.
420207060318 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70034510058.
The product of its (nonzero) digits is 16128, while the sum is 33.
The spelling of 420207060318 in words is "four hundred twenty billion, two hundred seven million, sixty thousand, three hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •