Base | Representation |
---|---|
bin | 1000011111011010001… |
… | …1011001111001111101 |
3 | 111221111221212221121021 |
4 | 2013312203121321331 |
5 | 4342220310201203 |
6 | 151002324504141 |
7 | 13352542626343 |
oct | 2076643317175 |
9 | 457457787537 |
10 | 145870397053 |
11 | 56955044357 |
12 | 2432b84b051 |
13 | 109a8b50c14 |
14 | 70bb141993 |
15 | 3bdb2a85bd |
hex | 21f68d9e7d |
145870397053 has 2 divisors, whose sum is σ = 145870397054. Its totient is φ = 145870397052.
The previous prime is 145870397027. The next prime is 145870397087. The reversal of 145870397053 is 350793078541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112561592004 + 33308805049 = 335502^2 + 182507^2 .
It is a cyclic number.
It is not a de Polignac number, because 145870397053 - 221 = 145868299901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145876397053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72935198526 + 72935198527.
It is an arithmetic number, because the mean of its divisors is an integer number (72935198527).
Almost surely, 2145870397053 is an apocalyptic number.
It is an amenable number.
145870397053 is a deficient number, since it is larger than the sum of its proper divisors (1).
145870397053 is an equidigital number, since it uses as much as digits as its factorization.
145870397053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3175200, while the sum is 52.
The spelling of 145870397053 in words is "one hundred forty-five billion, eight hundred seventy million, three hundred ninety-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •