Base | Representation |
---|---|
bin | 101001110010011… |
… | …1101111111001100 |
3 | 10121201111010210210 |
4 | 1103210331333030 |
5 | 10332430400022 |
6 | 351050002420 |
7 | 46514334453 |
oct | 12344757714 |
9 | 3551433723 |
10 | 1402200012 |
11 | 65a561694 |
12 | 331716410 |
13 | 19466bc65 |
14 | d4325b9a |
15 | 8317ba0c |
hex | 5393dfcc |
1402200012 has 48 divisors (see below), whose sum is σ = 3340183392. Its totient is φ = 457666560.
The previous prime is 1402199999. The next prime is 1402200013. The reversal of 1402200012 is 2100022041.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (1402200013) 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 15 ways as a sum of consecutive naturals, for example, 365062 + ... + 368882.
It is an arithmetic number, because the mean of its divisors is an integer number (69587154).
Almost surely, 21402200012 is an apocalyptic number.
1402200012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1402200012 is an abundant number, since it is smaller than the sum of its proper divisors (1937983380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1402200012 is a wasteful number, since it uses less digits than its factorization.
1402200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4458 (or 4456 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 1402200012 is about 37445.9612241427. The cubic root of 1402200012 is about 1119.2746185222.
Adding to 1402200012 its reverse (2100022041), we get a palindrome (3502222053).
The spelling of 1402200012 in words is "one billion, four hundred two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •