Base | Representation |
---|---|
bin | 1000011101011010100… |
… | …0001111100001010111 |
3 | 111220010122001111210021 |
4 | 2013112220033201113 |
5 | 4340121201404302 |
6 | 150433233010011 |
7 | 13333350240352 |
oct | 2072650174127 |
9 | 456118044707 |
10 | 145334794327 |
11 | 566aa780078 |
12 | 242003b3907 |
13 | 10921bb1928 |
14 | 7069d5d299 |
15 | 3ba925b437 |
hex | 21d6a0f857 |
145334794327 has 2 divisors, whose sum is σ = 145334794328. Its totient is φ = 145334794326.
The previous prime is 145334794307. The next prime is 145334794337. The reversal of 145334794327 is 723497433541.
145334794327 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 (723497433541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145334794327 - 211 = 145334792279 is a prime.
It is a super-2 number, since 2×1453347943272 (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 (145334794307) 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, 72667397163 + 72667397164.
It is an arithmetic number, because the mean of its divisors is an integer number (72667397164).
Almost surely, 2145334794327 is an apocalyptic number.
145334794327 is a deficient number, since it is larger than the sum of its proper divisors (1).
145334794327 is an equidigital number, since it uses as much as digits as its factorization.
145334794327 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7620480, while the sum is 52.
The spelling of 145334794327 in words is "one hundred forty-five billion, three hundred thirty-four million, seven hundred ninety-four thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •