Base | Representation |
---|---|
bin | 1101001110000110011110… |
… | …1000010101110010010100 |
3 | 1220110121201102021221001000 |
4 | 3103201213220111302110 |
5 | 3401124014414123113 |
6 | 50525412014303300 |
7 | 3030120231005031 |
oct | 323414750256224 |
9 | 56417642257030 |
10 | 14535907957908 |
11 | 46a470a101357 |
12 | 17691a61b7b30 |
13 | 81596544729c |
14 | 3837825ca388 |
15 | 1a31a4161373 |
hex | d3867a15c94 |
14535907957908 has 24 divisors (see below), whose sum is σ = 37685687298560. Its totient is φ = 4845302652600.
The previous prime is 14535907957903. The next prime is 14535907957919. The reversal of 14535907957908 is 80975970953541.
14535907957908 is a `hidden beast` number, since 1 + 45 + 3 + 5 + 9 + 0 + 7 + 9 + 579 + 0 + 8 = 666.
It is a super-2 number, since 2×145359079579082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14535907957903) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67295870068 + ... + 67295870283.
Almost surely, 214535907957908 is an apocalyptic number.
14535907957908 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
14535907957908 is an abundant number, since it is smaller than the sum of its proper divisors (23149779340652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14535907957908 is a wasteful number, since it uses less digits than its factorization.
14535907957908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134591740364 (or 134591740356 counting only the distinct ones).
The product of its (nonzero) digits is 428652000, while the sum is 72.
The spelling of 14535907957908 in words is "fourteen trillion, five hundred thirty-five billion, nine hundred seven million, nine hundred fifty-seven thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •