Base | Representation |
---|---|
bin | 100001000100000010011100… |
… | …110001111111000100111101 |
3 | 201001212100110222212022102001 |
4 | 201010002130301333010331 |
5 | 123024421403014404433 |
6 | 1233133455123102301 |
7 | 42425513523461356 |
oct | 4104023461770475 |
9 | 631770428768361 |
10 | 145413043122493 |
11 | 42373363a29083 |
12 | 14386031b11991 |
13 | 631a511402853 |
14 | 27ca0591c8d2d |
15 | 11c27d872557d |
hex | 84409cc7f13d |
145413043122493 has 2 divisors, whose sum is σ = 145413043122494. Its totient is φ = 145413043122492.
The previous prime is 145413043122433. The next prime is 145413043122511. The reversal of 145413043122493 is 394221340314541.
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., 144544786291684 + 868256830809 = 12022678^2 + 931803^2 .
It is a cyclic number.
It is not a de Polignac number, because 145413043122493 - 217 = 145413042991421 is a prime.
It is a super-2 number, since 2×1454130431224932 (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 (145413043122433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72706521561246 + 72706521561247.
It is an arithmetic number, because the mean of its divisors is an integer number (72706521561247).
Almost surely, 2145413043122493 is an apocalyptic number.
It is an amenable number.
145413043122493 is a deficient number, since it is larger than the sum of its proper divisors (1).
145413043122493 is an equidigital number, since it uses as much as digits as its factorization.
145413043122493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1244160, while the sum is 46.
The spelling of 145413043122493 in words is "one hundred forty-five trillion, four hundred thirteen billion, forty-three million, one hundred twenty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •