Base | Representation |
---|---|
bin | 1100111010101110101011… |
… | …1011101101000100001000 |
3 | 1212021210200200210201000002 |
4 | 3032223222323231010020 |
5 | 3330200423432301300 |
6 | 50112452101502132 |
7 | 2664066066643421 |
oct | 316535273550410 |
9 | 55253620721002 |
10 | 14203103400200 |
11 | 4586558660340 |
12 | 17147a6711948 |
13 | 7c04681bb9b0 |
14 | 371610790648 |
15 | 1996c6a3d5d5 |
hex | ceaeaeed108 |
14203103400200 has 192 divisors, whose sum is σ = 41077409627520. Its totient is φ = 4487035392000.
The previous prime is 14203103400197. The next prime is 14203103400257. The reversal of 14203103400200 is 200430130241.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14120036 + ... + 15092435.
It is an arithmetic number, because the mean of its divisors is an integer number (213944841810).
Almost surely, 214203103400200 is an apocalyptic number.
14203103400200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14203103400200 is an abundant number, since it is smaller than the sum of its proper divisors (26874306227320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14203103400200 is a wasteful number, since it uses less digits than its factorization.
14203103400200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29212528 (or 29212519 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 14203103400200 its reverse (200430130241), we get a palindrome (14403533530441).
The spelling of 14203103400200 in words is "fourteen trillion, two hundred three billion, one hundred three million, four hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •