Base | Representation |
---|---|
bin | 1000011101001111010… |
… | …1110000010101010111 |
3 | 111220000101000100211102 |
4 | 2013103311300111113 |
5 | 4340022212124301 |
6 | 150424442100315 |
7 | 13332241444235 |
oct | 2072365602527 |
9 | 456011010742 |
10 | 145288004951 |
11 | 56686322571 |
12 | 241a87aa69b |
13 | 109152ab9cb |
14 | 7063a5d955 |
15 | 3ba50b7b6b |
hex | 21d3d70557 |
145288004951 has 4 divisors (see below), whose sum is σ = 145290029400. Its totient is φ = 145285980504.
The previous prime is 145288004929. The next prime is 145288005011. The reversal of 145288004951 is 159400882541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 159400882541 = 3343 ⋅47681987.
It is a cyclic number.
It is not a de Polignac number, because 145288004951 - 218 = 145287742807 is a prime.
It is a super-2 number, since 2×1452880049512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145288004896 and 145288004905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145288004051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 900461 + ... + 1049478.
It is an arithmetic number, because the mean of its divisors is an integer number (36322507350).
Almost surely, 2145288004951 is an apocalyptic number.
145288004951 is a deficient number, since it is larger than the sum of its proper divisors (2024449).
145288004951 is an equidigital number, since it uses as much as digits as its factorization.
145288004951 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2024448.
The product of its (nonzero) digits is 460800, while the sum is 47.
The spelling of 145288004951 in words is "one hundred forty-five billion, two hundred eighty-eight million, four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •