Base | Representation |
---|---|
bin | 1000011111001111101… |
… | …1100001110101111001 |
3 | 111221101220002010102001 |
4 | 2013303323201311321 |
5 | 4342123023424434 |
6 | 150554113341001 |
7 | 13351466600143 |
oct | 2076373416571 |
9 | 457356063361 |
10 | 145826389369 |
11 | 56932216771 |
12 | 24318b67761 |
13 | 1099c9b317b |
14 | 70b5367c93 |
15 | 3bd74b4114 |
hex | 21f3ee1d79 |
145826389369 has 2 divisors, whose sum is σ = 145826389370. Its totient is φ = 145826389368.
The previous prime is 145826389361. The next prime is 145826389403. The reversal of 145826389369 is 963983628541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136429025769 + 9397363600 = 369363^2 + 96940^2 .
It is a cyclic number.
It is not a de Polignac number, because 145826389369 - 23 = 145826389361 is a prime.
It is a super-2 number, since 2×1458263893692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145826389369.
It is not a weakly prime, because it can be changed into another prime (145826389361) 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, 72913194684 + 72913194685.
It is an arithmetic number, because the mean of its divisors is an integer number (72913194685).
Almost surely, 2145826389369 is an apocalyptic number.
It is an amenable number.
145826389369 is a deficient number, since it is larger than the sum of its proper divisors (1).
145826389369 is an equidigital number, since it uses as much as digits as its factorization.
145826389369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 67184640, while the sum is 64.
The spelling of 145826389369 in words is "one hundred forty-five billion, eight hundred twenty-six million, three hundred eighty-nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •