Base | Representation |
---|---|
bin | 1000011101000100111… |
… | …0111001101111111101 |
3 | 111212220022201011112121 |
4 | 2013101032321233331 |
5 | 4334430012443334 |
6 | 150420240402541 |
7 | 13331200613002 |
oct | 2072116715775 |
9 | 455808634477 |
10 | 145244265469 |
11 | 56663668436 |
12 | 24196016451 |
13 | 10909206064 |
14 | 705bd158a9 |
15 | 3ba1327db4 |
hex | 21d13b9bfd |
145244265469 has 2 divisors, whose sum is σ = 145244265470. Its totient is φ = 145244265468.
The previous prime is 145244265421. The next prime is 145244265511. The reversal of 145244265469 is 964562442541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108366056100 + 36878209369 = 329190^2 + 192037^2 .
It is an emirp because it is prime and its reverse (964562442541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145244265469 is a prime.
It is a super-2 number, since 2×1452442654692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145244262469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72622132734 + 72622132735.
It is an arithmetic number, because the mean of its divisors is an integer number (72622132735).
Almost surely, 2145244265469 is an apocalyptic number.
It is an amenable number.
145244265469 is a deficient number, since it is larger than the sum of its proper divisors (1).
145244265469 is an equidigital number, since it uses as much as digits as its factorization.
145244265469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8294400, while the sum is 52.
The spelling of 145244265469 in words is "one hundred forty-five billion, two hundred forty-four million, two hundred sixty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •