Base | Representation |
---|---|
bin | 1100110111000000011001… |
… | …0111010111100011001100 |
3 | 1212001200120220201222110001 |
4 | 3031300012113113203030 |
5 | 3323123424104040000 |
6 | 50023233021254044 |
7 | 2656343022413362 |
oct | 315600627274314 |
9 | 55050526658401 |
10 | 14139139127500 |
11 | 4561414481552 |
12 | 1704315104324 |
13 | 7b741336bc1a |
14 | 36c4a3607632 |
15 | 197bd127146a |
hex | cdc065d78cc |
14139139127500 has 30 divisors (see below), whose sum is σ = 30919469449484. Its totient is φ = 5655655650000.
The previous prime is 14139139127483. The next prime is 14139139127501. The reversal of 14139139127500 is 572193193141.
14139139127500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×141391391275002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14139139127501) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2827825326 + ... + 2827830325.
Almost surely, 214139139127500 is an apocalyptic number.
14139139127500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14139139127500 is an abundant number, since it is smaller than the sum of its proper divisors (16780330321984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14139139127500 is an equidigital number, since it uses as much as digits as its factorization.
14139139127500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5655655675 (or 5655655658 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 46.
The spelling of 14139139127500 in words is "fourteen trillion, one hundred thirty-nine billion, one hundred thirty-nine million, one hundred twenty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •