Base | Representation |
---|---|
bin | 1100110001100010100010… |
… | …1010110000100100011001 |
3 | 1211201201011220102001111212 |
4 | 3030120220222300210121 |
5 | 3320104110142334140 |
6 | 45512142031232505 |
7 | 2646506530466066 |
oct | 314305052604431 |
9 | 54651156361455 |
10 | 14045225355545 |
11 | 452560161168a |
12 | 16aa085678735 |
13 | 7ab5c7759367 |
14 | 367b149ddc6d |
15 | 195536503765 |
hex | cc628ab0919 |
14045225355545 has 8 divisors (see below), whose sum is σ = 17309791249224. Its totient is φ = 10932499736064.
The previous prime is 14045225355493. The next prime is 14045225355599. The reversal of 14045225355545 is 54555352254041.
It can be written as a sum of positive squares in 4 ways, for example, as 2221778056969 + 11823447298576 = 1490563^2 + 3438524^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14045225355545 - 210 = 14045225354521 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14045225355493 and 14045225355502.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37960068344 + ... + 37960068713.
It is an arithmetic number, because the mean of its divisors is an integer number (2163723906153).
Almost surely, 214045225355545 is an apocalyptic number.
It is an amenable number.
14045225355545 is a deficient number, since it is larger than the sum of its proper divisors (3264565893679).
14045225355545 is an equidigital number, since it uses as much as digits as its factorization.
14045225355545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75920137099.
The product of its (nonzero) digits is 12000000, while the sum is 50.
The spelling of 14045225355545 in words is "fourteen trillion, forty-five billion, two hundred twenty-five million, three hundred fifty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •