Base | Representation |
---|---|
bin | 1101010000101000010101… |
… | …1100101110010001001100 |
3 | 1220121202212112000202222220 |
4 | 3110022011130232101030 |
5 | 3402332011110330100 |
6 | 51001355313335340 |
7 | 3033216036305421 |
oct | 324120534562114 |
9 | 56552775022886 |
10 | 14579357901900 |
11 | 47110864a8380 |
12 | 17756b1567550 |
13 | 819a9b18b40c |
14 | 385905045d48 |
15 | 1a4398968aa0 |
hex | d428572e44c |
14579357901900 has 72 divisors (see below), whose sum is σ = 46017755133504. Its totient is φ = 3534389793600.
The previous prime is 14579357901883. The next prime is 14579357901919. The reversal of 14579357901900 is 910975397541.
It is a super-3 number, since 3×145793579019003 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (60).
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 23 ways as a sum of consecutive naturals, for example, 2208990322 + ... + 2208996921.
Almost surely, 214579357901900 is an apocalyptic number.
14579357901900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14579357901900 is an abundant number, since it is smaller than the sum of its proper divisors (31438397231604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14579357901900 is a wasteful number, since it uses less digits than its factorization.
14579357901900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4417987271 (or 4417987264 counting only the distinct ones).
The product of its (nonzero) digits is 10716300, while the sum is 60.
The spelling of 14579357901900 in words is "fourteen trillion, five hundred seventy-nine billion, three hundred fifty-seven million, nine hundred one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •