Base | Representation |
---|---|
bin | 1101001111000111010001… |
… | …0101101001010001110000 |
3 | 1220112021121120102112111021 |
4 | 3103301310111221101300 |
5 | 3401420130030430000 |
6 | 50541405540225224 |
7 | 3031304236455025 |
oct | 323616425512160 |
9 | 56467546375437 |
10 | 14553301030000 |
11 | 47010250338a7 |
12 | 177063b09b214 |
13 | 8174a79c4815 |
14 | 38455258954c |
15 | 1a38710ce11a |
hex | d3c74569470 |
14553301030000 has 50 divisors (see below), whose sum is σ = 35234997147944. Its totient is φ = 5821320408000.
The previous prime is 14553301029997. The next prime is 14553301030001. The reversal of 14553301030000 is 3010335541.
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14553301030001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 727655052 + ... + 727675051.
Almost surely, 214553301030000 is an apocalyptic number.
14553301030000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14553301030000 is an abundant number, since it is smaller than the sum of its proper divisors (20681696117944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14553301030000 is an equidigital number, since it uses as much as digits as its factorization.
14553301030000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455330131 (or 1455330110 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 14553301030000 its reverse (3010335541), we get a palindrome (14556311365541).
The spelling of 14553301030000 in words is "fourteen trillion, five hundred fifty-three billion, three hundred one million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •