Base | Representation |
---|---|
bin | 11010011101000001… |
… | …10111010111000100 |
3 | 1100122202211110122220 |
4 | 31032200313113010 |
5 | 213041221440400 |
6 | 10305133052340 |
7 | 1011641125161 |
oct | 151640672704 |
9 | 40582743586 |
10 | 14202140100 |
11 | 6028813075 |
12 | 29043270b0 |
13 | 14544652c5 |
14 | 98a295068 |
15 | 581c617a0 |
hex | 34e8375c4 |
14202140100 has 72 divisors (see below), whose sum is σ = 41107348128. Its totient is φ = 3785779200.
The previous prime is 14202140077. The next prime is 14202140137. The reversal of 14202140100 is 104120241.
14202140100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 14202140100.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 933555 + ... + 948645.
Almost surely, 214202140100 is an apocalyptic number.
14202140100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14202140100 is an abundant number, since it is smaller than the sum of its proper divisors (26905208028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14202140100 is a wasteful number, since it uses less digits than its factorization.
14202140100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18245 (or 18238 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 14202140100 its reverse (104120241), we get a palindrome (14306260341).
The spelling of 14202140100 in words is "fourteen billion, two hundred two million, one hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •