Base | Representation |
---|---|
bin | 1000011101100000101… |
… | …0100010111110000011 |
3 | 111220012102112202021021 |
4 | 2013120022202332003 |
5 | 4340144301022344 |
6 | 150435553210311 |
7 | 13334112260032 |
oct | 2073012427603 |
9 | 456172482237 |
10 | 145360564099 |
11 | 56713281303 |
12 | 24208b60997 |
13 | 1092733530a |
14 | 706d54a719 |
15 | 3bab64bb84 |
hex | 21d82a2f83 |
145360564099 has 2 divisors, whose sum is σ = 145360564100. Its totient is φ = 145360564098.
The previous prime is 145360564081. The next prime is 145360564169. The reversal of 145360564099 is 990465063541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145360564099 - 25 = 145360564067 is a prime.
It is a super-2 number, since 2×1453605640992 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (145360564039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72680282049 + 72680282050.
It is an arithmetic number, because the mean of its divisors is an integer number (72680282050).
Almost surely, 2145360564099 is an apocalyptic number.
145360564099 is a deficient number, since it is larger than the sum of its proper divisors (1).
145360564099 is an equidigital number, since it uses as much as digits as its factorization.
145360564099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 52.
The spelling of 145360564099 in words is "one hundred forty-five billion, three hundred sixty million, five hundred sixty-four thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •