Base | Representation |
---|---|
bin | 1100110100101111011000… |
… | …0001010011001101011000 |
3 | 1211220222002220002122011110 |
4 | 3031023312001103031120 |
5 | 3322004212302421212 |
6 | 45553314103300320 |
7 | 2653464232122165 |
oct | 315136601231530 |
9 | 54828086078143 |
10 | 14100210201432 |
11 | 4546958081183 |
12 | 16b886ba4a6a0 |
13 | 7b384b180124 |
14 | 36a64d3a906c |
15 | 196ba3809a3c |
hex | cd2f6053358 |
14100210201432 has 64 divisors (see below), whose sum is σ = 37553068126080. Its totient is φ = 4396456714752.
The previous prime is 14100210201421. The next prime is 14100210201463. The reversal of 14100210201432 is 23410201200141.
It is a junction number, because it is equal to n+sod(n) for n = 14100210201399 and 14100210201408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105943738 + ... + 106076745.
It is an arithmetic number, because the mean of its divisors is an integer number (586766689470).
Almost surely, 214100210201432 is an apocalyptic number.
14100210201432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14100210201432 is an abundant number, since it is smaller than the sum of its proper divisors (23452857924648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14100210201432 is a wasteful number, since it uses less digits than its factorization.
14100210201432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212020672 (or 212020668 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 14100210201432 its reverse (23410201200141), we get a palindrome (37510411401573).
The spelling of 14100210201432 in words is "fourteen trillion, one hundred billion, two hundred ten million, two hundred one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •