Base | Representation |
---|---|
bin | 1101000001101110100110… |
… | …0110011001010001110001 |
3 | 1212201022001012101222200000 |
4 | 3100123221212121101301 |
5 | 3334133200032334301 |
6 | 50244015052020213 |
7 | 3005553502133466 |
oct | 320335146312161 |
9 | 55638035358600 |
10 | 14323340121201 |
11 | 46225490a9451 |
12 | 1733b61761669 |
13 | 7cb8ba449557 |
14 | 37737931766d |
15 | 19c8b26a3786 |
hex | d06e9999471 |
14323340121201 has 144 divisors (see below), whose sum is σ = 23353990627968. Its totient is φ = 8764824153600.
The previous prime is 14323340121191. The next prime is 14323340121203. The reversal of 14323340121201 is 10212104332341.
14323340121201 is a `hidden beast` number, since 1 + 4 + 3 + 2 + 33 + 401 + 21 + 201 = 666.
It is not a de Polignac number, because 14323340121201 - 25 = 14323340121169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (14323340121203) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 782216836 + ... + 782235146.
It is an arithmetic number, because the mean of its divisors is an integer number (162180490472).
Almost surely, 214323340121201 is an apocalyptic number.
It is an amenable number.
14323340121201 is a deficient number, since it is larger than the sum of its proper divisors (9030650506767).
14323340121201 is a wasteful number, since it uses less digits than its factorization.
14323340121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18642 (or 18611 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 14323340121201 its reverse (10212104332341), we get a palindrome (24535444453542).
The spelling of 14323340121201 in words is "fourteen trillion, three hundred twenty-three billion, three hundred forty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •