Base | Representation |
---|---|
bin | 1101001001001010100111… |
… | …0110000010001101001100 |
3 | 1220011111212100211220000022 |
4 | 3102102221312002031030 |
5 | 3343231343042414220 |
6 | 50422430323321312 |
7 | 3021026132666060 |
oct | 322225166021514 |
9 | 56144770756008 |
10 | 14451119498060 |
11 | 467175a242543 |
12 | 1754882820238 |
13 | 80a97224b79b |
14 | 37d61b8d7aa0 |
15 | 1a0d905c4925 |
hex | d24a9d8234c |
14451119498060 has 48 divisors (see below), whose sum is σ = 36508091370240. Its totient is φ = 4693897460160.
The previous prime is 14451119498033. The next prime is 14451119498071. The reversal of 14451119498060 is 6089491115441.
It is a junction number, because it is equal to n+sod(n) for n = 14451119497993 and 14451119498011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2716373186 + ... + 2716378505.
It is an arithmetic number, because the mean of its divisors is an integer number (760585236880).
Almost surely, 214451119498060 is an apocalyptic number.
14451119498060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14451119498060 is an abundant number, since it is smaller than the sum of its proper divisors (22056971872180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14451119498060 is a wasteful number, since it uses less digits than its factorization.
14451119498060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5432751726 (or 5432751724 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 53.
The spelling of 14451119498060 in words is "fourteen trillion, four hundred fifty-one billion, one hundred nineteen million, four hundred ninety-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •