Base | Representation |
---|---|
bin | 1101000001110101010111… |
… | …0010011101111111001111 |
3 | 1212201110201200211211202001 |
4 | 3100131111302131333033 |
5 | 3334200404214204201 |
6 | 50244515132013131 |
7 | 3005646462230062 |
oct | 320352562357717 |
9 | 55643650754661 |
10 | 14325155225551 |
11 | 462329a73a195 |
12 | 17343896011a7 |
13 | 7cbb194c75b1 |
14 | 3774ac4028d9 |
15 | 19c96bbe2301 |
hex | d0755c9dfcf |
14325155225551 has 4 divisors (see below), whose sum is σ = 14325166057752. Its totient is φ = 14325144393352.
The previous prime is 14325155225527. The next prime is 14325155225587. The reversal of 14325155225551 is 15552255152341.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 14325155225551 - 25 = 14325155225519 is a prime.
It is a super-2 number, since 2×143251552255512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14325155205551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3103165 + ... + 6187078.
It is an arithmetic number, because the mean of its divisors is an integer number (3581291514438).
Almost surely, 214325155225551 is an apocalyptic number.
14325155225551 is a deficient number, since it is larger than the sum of its proper divisors (10832201).
14325155225551 is an equidigital number, since it uses as much as digits as its factorization.
14325155225551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10832200.
The product of its digits is 1500000, while the sum is 46.
The spelling of 14325155225551 in words is "fourteen trillion, three hundred twenty-five billion, one hundred fifty-five million, two hundred twenty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •