Base | Representation |
---|---|
bin | 1100110110000101000011… |
… | …1100011110100000100111 |
3 | 1212000011110211012212111101 |
4 | 3031201100330132200213 |
5 | 3322343313342001020 |
6 | 50012040251420531 |
7 | 2655240215334502 |
oct | 315412074364047 |
9 | 55004424185441 |
10 | 14123210500135 |
11 | 4555690155000 |
12 | 170120a754747 |
13 | 7b5a75315229 |
14 | 36b7d1d34139 |
15 | 19759cb7800a |
hex | cd850f1e827 |
14123210500135 has 32 divisors (see below), whose sum is σ = 18822349578240. Its totient is φ = 10171702743840.
The previous prime is 14123210500129. The next prime is 14123210500141. The reversal of 14123210500135 is 53100501232141.
It is an interprime number because it is at equal distance from previous prime (14123210500129) and next prime (14123210500141).
It is not a de Polignac number, because 14123210500135 - 217 = 14123210369063 is a prime.
It is a super-2 number, since 2×141232105001352 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9616455 + ... + 10987384.
It is an arithmetic number, because the mean of its divisors is an integer number (588198424320).
Almost surely, 214123210500135 is an apocalyptic number.
14123210500135 is a deficient number, since it is larger than the sum of its proper divisors (4699139078105).
14123210500135 is a wasteful number, since it uses less digits than its factorization.
14123210500135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20603980 (or 20603958 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 14123210500135 its reverse (53100501232141), we get a palindrome (67223711732276).
The spelling of 14123210500135 in words is "fourteen trillion, one hundred twenty-three billion, two hundred ten million, five hundred thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •