Base | Representation |
---|---|
bin | 100001000111110111011111… |
… | …001011010110001110001011 |
3 | 201002210111121101000012102011 |
4 | 201013313133023112032023 |
5 | 123043224223404302303 |
6 | 1233454411030120351 |
7 | 42453516541604452 |
oct | 4107673713261613 |
9 | 632714541005364 |
10 | 145676150072203 |
11 | 424649a9a45673 |
12 | 1440901bab00b7 |
13 | 6339281a6b28a |
14 | 27d8a98645b99 |
15 | 11c958706a16d |
hex | 847ddf2d638b |
145676150072203 has 2 divisors, whose sum is σ = 145676150072204. Its totient is φ = 145676150072202.
The previous prime is 145676150072147. The next prime is 145676150072213. The reversal of 145676150072203 is 302270051676541.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145676150072203 is a prime.
It is a super-2 number, since 2×1456761500722032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (145676150072213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72838075036101 + 72838075036102.
It is an arithmetic number, because the mean of its divisors is an integer number (72838075036102).
Almost surely, 2145676150072203 is an apocalyptic number.
145676150072203 is a deficient number, since it is larger than the sum of its proper divisors (1).
145676150072203 is an equidigital number, since it uses as much as digits as its factorization.
145676150072203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2116800, while the sum is 49.
The spelling of 145676150072203 in words is "one hundred forty-five trillion, six hundred seventy-six billion, one hundred fifty million, seventy-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •