Base | Representation |
---|---|
bin | 1101001110101000100000… |
… | …1100100001101010000111 |
3 | 1220111111022010211121120211 |
4 | 3103222020030201222013 |
5 | 3401301222311433343 |
6 | 50533522344540251 |
7 | 3030562520131615 |
oct | 323521014415207 |
9 | 56444263747524 |
10 | 14545044249223 |
11 | 46a8578321234 |
12 | 176ab15a81687 |
13 | 816790206817 |
14 | 383dabb5c6b5 |
15 | 1a353b2b079d |
hex | d3a88321a87 |
14545044249223 has 2 divisors, whose sum is σ = 14545044249224. Its totient is φ = 14545044249222.
The previous prime is 14545044249173. The next prime is 14545044249271. The reversal of 14545044249223 is 32294244054541.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14545044249223 is a prime.
It is a super-2 number, since 2×145450442492232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14545044249293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7272522124611 + 7272522124612.
It is an arithmetic number, because the mean of its divisors is an integer number (7272522124612).
Almost surely, 214545044249223 is an apocalyptic number.
14545044249223 is a deficient number, since it is larger than the sum of its proper divisors (1).
14545044249223 is an equidigital number, since it uses as much as digits as its factorization.
14545044249223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5529600, while the sum is 49.
The spelling of 14545044249223 in words is "fourteen trillion, five hundred forty-five billion, forty-four million, two hundred forty-nine thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •