Base | Representation |
---|---|
bin | 100000111111100010111101… |
… | …011100100111001011010101 |
3 | 201000202211200212220212021001 |
4 | 200333202331130213023111 |
5 | 123004342204000204024 |
6 | 1232340004133423301 |
7 | 42364305102250642 |
oct | 4077427534471325 |
9 | 630684625825231 |
10 | 145104353522389 |
11 | 42264457778698 |
12 | 1433624249ab31 |
13 | 62c7388223341 |
14 | 27b9133d90dc9 |
15 | 11b976d250244 |
hex | 83f8bd7272d5 |
145104353522389 has 2 divisors, whose sum is σ = 145104353522390. Its totient is φ = 145104353522388.
The previous prime is 145104353522291. The next prime is 145104353522413. The reversal of 145104353522389 is 983225353401541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109304055800164 + 35800297722225 = 10454858^2 + 5983335^2 .
It is a cyclic number.
It is not a de Polignac number, because 145104353522389 - 29 = 145104353521877 is a prime.
It is a super-2 number, since 2×1451043535223892 (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 (145104353525389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72552176761194 + 72552176761195.
It is an arithmetic number, because the mean of its divisors is an integer number (72552176761195).
Almost surely, 2145104353522389 is an apocalyptic number.
It is an amenable number.
145104353522389 is a deficient number, since it is larger than the sum of its proper divisors (1).
145104353522389 is an equidigital number, since it uses as much as digits as its factorization.
145104353522389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552000, while the sum is 55.
The spelling of 145104353522389 in words is "one hundred forty-five trillion, one hundred four billion, three hundred fifty-three million, five hundred twenty-two thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •