Base | Representation |
---|---|
bin | 1000011110110011110… |
… | …1000011001000110011 |
3 | 111221002201211202222112 |
4 | 2013230331003020303 |
5 | 4341403043104004 |
6 | 150534332555535 |
7 | 13345546005641 |
oct | 2075475031063 |
9 | 457081752875 |
10 | 145709347379 |
11 | 56882145352 |
12 | 242a5922bab |
13 | 1098168375b |
14 | 70a39bc191 |
15 | 3bcc094e6e |
hex | 21ecf43233 |
145709347379 has 2 divisors, whose sum is σ = 145709347380. Its totient is φ = 145709347378.
The previous prime is 145709347349. The next prime is 145709347387. The reversal of 145709347379 is 973743907541.
145709347379 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (973743907541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145709347379 - 28 = 145709347123 is a prime.
It is a super-2 number, since 2×1457093473792 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (145709347349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72854673689 + 72854673690.
It is an arithmetic number, because the mean of its divisors is an integer number (72854673690).
Almost surely, 2145709347379 is an apocalyptic number.
145709347379 is a deficient number, since it is larger than the sum of its proper divisors (1).
145709347379 is an equidigital number, since it uses as much as digits as its factorization.
145709347379 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20003760, while the sum is 59.
The spelling of 145709347379 in words is "one hundred forty-five billion, seven hundred nine million, three hundred forty-seven thousand, three hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •