Base | Representation |
---|---|
bin | 100001000010100010111111… |
… | …111011100000000100101101 |
3 | 201001111112221022202100100102 |
4 | 201002202333323200010231 |
5 | 123021232003210320042 |
6 | 1233014425145040445 |
7 | 42415224660111536 |
oct | 4102427773400455 |
9 | 631445838670312 |
10 | 145310553604397 |
11 | 423339502a9205 |
12 | 1436a1aa486125 |
13 | 6310959bc399c |
14 | 27c50d568568d |
15 | 11becdab80b32 |
hex | 8428bfee012d |
145310553604397 has 2 divisors, whose sum is σ = 145310553604398. Its totient is φ = 145310553604396.
The previous prime is 145310553604319. The next prime is 145310553604421. The reversal of 145310553604397 is 793406355013541.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97410464866276 + 47900088738121 = 9869674^2 + 6920989^2 .
It is a cyclic number.
It is not a de Polignac number, because 145310553604397 - 222 = 145310549410093 is a prime.
It is a super-2 number, since 2×1453105536043972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145310553606397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72655276802198 + 72655276802199.
It is an arithmetic number, because the mean of its divisors is an integer number (72655276802199).
Almost surely, 2145310553604397 is an apocalyptic number.
It is an amenable number.
145310553604397 is a deficient number, since it is larger than the sum of its proper divisors (1).
145310553604397 is an equidigital number, since it uses as much as digits as its factorization.
145310553604397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20412000, while the sum is 56.
The spelling of 145310553604397 in words is "one hundred forty-five trillion, three hundred ten billion, five hundred fifty-three million, six hundred four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •