Base | Representation |
---|---|
bin | 1110111001110001… |
… | …1001010101010010 |
3 | 101022210111110020020 |
4 | 3232130121111102 |
5 | 31143101434302 |
6 | 1500542524310 |
7 | 201064006401 |
oct | 35634312522 |
9 | 11283443206 |
10 | 4000421202 |
11 | 1773151728 |
12 | 937896696 |
13 | 4b9a3b34b |
14 | 29d423638 |
15 | 186309ebc |
hex | ee719552 |
4000421202 has 8 divisors (see below), whose sum is σ = 8000842416. Its totient is φ = 1333473732.
The previous prime is 4000421189. The next prime is 4000421207. The reversal of 4000421202 is 2021240004.
It is a sphenic number, since it is the product of 3 distinct primes.
4000421202 is an admirable number.
It is a super-2 number, since 2×40004212022 = 32006739586822249608, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4000421207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 333368428 + ... + 333368439.
It is an arithmetic number, because the mean of its divisors is an integer number (1000105302).
Almost surely, 24000421202 is an apocalyptic number.
4000421202 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.
4000421202 is a wasteful number, since it uses less digits than its factorization.
4000421202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666736872.
The product of its (nonzero) digits is 128, while the sum is 15.
The square root of 4000421202 is about 63248.8830098999. The cubic root of 4000421202 is about 1587.4567680541.
Adding to 4000421202 its reverse (2021240004), we get a palindrome (6021661206).
The spelling of 4000421202 in words is "four billion, four hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •