Base | Representation |
---|---|
bin | 1101000000011011011101… |
… | …0011011000100000000000 |
3 | 1212122011102202212111202202 |
4 | 3100012313103120200000 |
5 | 3333301442442040000 |
6 | 50225444253132332 |
7 | 3004133433361211 |
oct | 320066723304000 |
9 | 55564382774682 |
10 | 14301021440000 |
11 | 4614035859979 |
12 | 172b77318a0a8 |
13 | 7c9771588709 |
14 | 37625d0dd408 |
15 | 19c0080c5dd5 |
hex | d01b74d8800 |
14301021440000 has 120 divisors (see below), whose sum is σ = 35732390123430. Its totient is φ = 5720408064000.
The previous prime is 14301021439949. The next prime is 14301021440003. The reversal of 14301021440000 is 4412010341.
It can be written as a sum of positive squares in 5 ways, for example, as 64345424896 + 14236676015104 = 253664^2 + 3773152^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (14301021440003) 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, 4306337 + ... + 6866336.
Almost surely, 214301021440000 is an apocalyptic number.
14301021440000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14301021440000 is an abundant number, since it is smaller than the sum of its proper divisors (21431368683430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14301021440000 is an frugal number, since it uses more digits than its factorization.
14301021440000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11172715 (or 11172680 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 14301021440000 its reverse (4412010341), we get a palindrome (14305433450341).
The spelling of 14301021440000 in words is "fourteen trillion, three hundred one billion, twenty-one million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •