Base | Representation |
---|---|
bin | 100001000111010011101110… |
… | …010100010111110010011001 |
3 | 201002122211111011100110011021 |
4 | 201013103232110113302121 |
5 | 123042112102320443424 |
6 | 1233425020342202441 |
7 | 42450660124314256 |
oct | 4107235624276231 |
9 | 632584434313137 |
10 | 145637749390489 |
11 | 4244a693843084 |
12 | 144016a3723421 |
13 | 63357721433c5 |
14 | 27d6c9463242d |
15 | 11c858ab9a4e4 |
hex | 8474ee517c99 |
145637749390489 has 2 divisors, whose sum is σ = 145637749390490. Its totient is φ = 145637749390488.
The previous prime is 145637749390411. The next prime is 145637749390579. The reversal of 145637749390489 is 984093947736541.
145637749390489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 144637183310400 + 1000566080089 = 12026520^2 + 1000283^2 .
It is a cyclic number.
It is not a de Polignac number, because 145637749390489 - 231 = 145635601906841 is a prime.
It is not a weakly prime, because it can be changed into another prime (145637749390589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72818874695244 + 72818874695245.
It is an arithmetic number, because the mean of its divisors is an integer number (72818874695245).
Almost surely, 2145637749390489 is an apocalyptic number.
It is an amenable number.
145637749390489 is a deficient number, since it is larger than the sum of its proper divisors (1).
145637749390489 is an equidigital number, since it uses as much as digits as its factorization.
145637749390489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4938071040, while the sum is 79.
The spelling of 145637749390489 in words is "one hundred forty-five trillion, six hundred thirty-seven billion, seven hundred forty-nine million, three hundred ninety thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •