Base | Representation |
---|---|
bin | 1100110101100011010100… |
… | …0101101000001011100000 |
3 | 1211222022002121022110202201 |
4 | 3031120311011220023200 |
5 | 3322221241204434100 |
6 | 50003541422222544 |
7 | 2654466605512606 |
oct | 315306505501340 |
9 | 54868077273681 |
10 | 14114153202400 |
11 | 4551862589179 |
12 | 16bb501424a54 |
13 | 7b4c60a22c64 |
14 | 36b1b3085876 |
15 | 19721c92e36a |
hex | cd6351682e0 |
14114153202400 has 36 divisors (see below), whose sum is σ = 34456176507312. Its totient is φ = 5645661280640.
The previous prime is 14114153202371. The next prime is 14114153202437. The reversal of 14114153202400 is 420235141141.
It is a happy number.
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 8821344952 + ... + 8821346551.
It is an arithmetic number, because the mean of its divisors is an integer number (957116014092).
Almost surely, 214114153202400 is an apocalyptic number.
14114153202400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14114153202400 is an abundant number, since it is smaller than the sum of its proper divisors (20342023304912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14114153202400 is a wasteful number, since it uses less digits than its factorization.
14114153202400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17642691523 (or 17642691510 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 14114153202400 its reverse (420235141141), we get a palindrome (14534388343541).
The spelling of 14114153202400 in words is "fourteen trillion, one hundred fourteen billion, one hundred fifty-three million, two hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •