Base | Representation |
---|---|
bin | 11010011100110001… |
… | …10100101100001100 |
3 | 1100122121212100220120 |
4 | 31032120310230030 |
5 | 213040202011022 |
6 | 10305015544540 |
7 | 1011614165145 |
oct | 151630645414 |
9 | 40577770816 |
10 | 14200032012 |
11 | 6027603251 |
12 | 290368b150 |
13 | 1453ba790a |
14 | 989ca6acc |
15 | 581996d5c |
hex | 34e634b0c |
14200032012 has 12 divisors (see below), whose sum is σ = 33133408056. Its totient is φ = 4733344000.
The previous prime is 14200032001. The next prime is 14200032023. The reversal of 14200032012 is 21023000241.
It is an interprime number because it is at equal distance from previous prime (14200032001) and next prime (14200032023).
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 14200031982 and 14200032000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 591667989 + ... + 591668012.
It is an arithmetic number, because the mean of its divisors is an integer number (2761117338).
Almost surely, 214200032012 is an apocalyptic number.
14200032012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14200032012 is an abundant number, since it is smaller than the sum of its proper divisors (18933376044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14200032012 is a wasteful number, since it uses less digits than its factorization.
14200032012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1183336008 (or 1183336006 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 14200032012 its reverse (21023000241), we get a palindrome (35223032253).
The spelling of 14200032012 in words is "fourteen billion, two hundred million, thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •