Base | Representation |
---|---|
bin | 1000011101101101111… |
… | …1110010000100011011 |
3 | 111220100022201200121211 |
4 | 2013123133302010123 |
5 | 4340303103300434 |
6 | 150445311243551 |
7 | 13335361352341 |
oct | 2073337620433 |
9 | 456308650554 |
10 | 145416462619 |
11 | 5674189072a |
12 | 242238195b7 |
13 | 10935aa746c |
14 | 7076b3b991 |
15 | 3bb14de464 |
hex | 21db7f211b |
145416462619 has 2 divisors, whose sum is σ = 145416462620. Its totient is φ = 145416462618.
The previous prime is 145416462511. The next prime is 145416462637. The reversal of 145416462619 is 916264614541.
It is a strong prime.
It is an emirp because it is prime and its reverse (916264614541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145416462619 - 231 = 143268978971 is a prime.
It is a super-2 number, since 2×1454164626192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (145416462689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72708231309 + 72708231310.
It is an arithmetic number, because the mean of its divisors is an integer number (72708231310).
Almost surely, 2145416462619 is an apocalyptic number.
145416462619 is a deficient number, since it is larger than the sum of its proper divisors (1).
145416462619 is an equidigital number, since it uses as much as digits as its factorization.
145416462619 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1244160, while the sum is 49.
The spelling of 145416462619 in words is "one hundred forty-five billion, four hundred sixteen million, four hundred sixty-two thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •