Base | Representation |
---|---|
bin | 1101001100110000100010… |
… | …1101010111110001010010 |
3 | 1220101102011210222222021220 |
4 | 3103030020231113301102 |
5 | 3400234244143323004 |
6 | 50511035033025510 |
7 | 3025342501514412 |
oct | 323141055276122 |
9 | 56342153888256 |
10 | 14512840604754 |
11 | 4695952199528 |
12 | 1764828b55296 |
13 | 81372a4352ab |
14 | 3825d4ba8642 |
15 | 1a27a3e99dd9 |
hex | d3308b57c52 |
14512840604754 has 16 divisors (see below), whose sum is σ = 30733074222048. Its totient is φ = 4553048032832.
The previous prime is 14512840604707. The next prime is 14512840604813. The reversal of 14512840604754 is 45740604821541.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 14512840604697 and 14512840604706.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71141375412 + ... + 71141375615.
It is an arithmetic number, because the mean of its divisors is an integer number (1920817138878).
Almost surely, 214512840604754 is an apocalyptic number.
14512840604754 is an abundant number, since it is smaller than the sum of its proper divisors (16220233617294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14512840604754 is a wasteful number, since it uses less digits than its factorization.
14512840604754 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142282751049.
The product of its (nonzero) digits is 4300800, while the sum is 51.
The spelling of 14512840604754 in words is "fourteen trillion, five hundred twelve billion, eight hundred forty million, six hundred four thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •