Base | Representation |
---|---|
bin | 1101000001101101110110… |
… | …1100111100101100101011 |
3 | 1212201021112021210211002012 |
4 | 3100123131230330230223 |
5 | 3334132242432400210 |
6 | 50243543201430135 |
7 | 3005545526366210 |
oct | 320333554745453 |
9 | 55637467724065 |
10 | 14323140512555 |
11 | 4622456463526 |
12 | 1733b0693b34b |
13 | 7cb887c9b424 |
14 | 37735a9d7b07 |
15 | 19c89edc5305 |
hex | d06ddb3cb2b |
14323140512555 has 8 divisors (see below), whose sum is σ = 19643164131552. Its totient is φ = 9821582065728.
The previous prime is 14323140512531. The next prime is 14323140512557. The reversal of 14323140512555 is 55521504132341.
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 14323140512555 - 220 = 14323139463979 is a prime.
It is a super-2 number, since 2×143231405125552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14323140512557) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204616293002 + ... + 204616293071.
It is an arithmetic number, because the mean of its divisors is an integer number (2455395516444).
Almost surely, 214323140512555 is an apocalyptic number.
14323140512555 is a deficient number, since it is larger than the sum of its proper divisors (5320023618997).
14323140512555 is an equidigital number, since it uses as much as digits as its factorization.
14323140512555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409232586085.
The product of its (nonzero) digits is 360000, while the sum is 41.
Adding to 14323140512555 its reverse (55521504132341), we get a palindrome (69844644644896).
The spelling of 14323140512555 in words is "fourteen trillion, three hundred twenty-three billion, one hundred forty million, five hundred twelve thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •