Base | Representation |
---|---|
bin | 1101000000011100111110… |
… | …1110100010000000010000 |
3 | 1212122012111022220222112102 |
4 | 3100013033232202000100 |
5 | 3333303312342210000 |
6 | 50225553052015532 |
7 | 3004146540354014 |
oct | 320071756420020 |
9 | 55565438828472 |
10 | 14301431210000 |
11 | 4614226098170 |
12 | 172b8684615a8 |
13 | 7c980843ac7c |
14 | 37629b6c8544 |
15 | 19c02e0693d5 |
hex | d01cfba2010 |
14301431210000 has 100 divisors (see below), whose sum is σ = 37772940402384. Its totient is φ = 5200520400000.
The previous prime is 14301431209999. The next prime is 14301431210023. The reversal of 14301431210000 is 1213410341.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 64896506 + ... + 65116505.
Almost surely, 214301431210000 is an apocalyptic number.
14301431210000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14301431210000 is an abundant number, since it is smaller than the sum of its proper divisors (23471509192384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14301431210000 is a wasteful number, since it uses less digits than its factorization.
14301431210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130013050 (or 130013029 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 14301431210000 its reverse (1213410341), we get a palindrome (14302644620341).
The spelling of 14301431210000 in words is "fourteen trillion, three hundred one billion, four hundred thirty-one million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •