Base | Representation |
---|---|
bin | 1000011100010101000… |
… | …1001010000100101111 |
3 | 111212101022222202021202 |
4 | 2013011101022010233 |
5 | 4334022120430111 |
6 | 150344310120115 |
7 | 13323212443331 |
oct | 2070521120457 |
9 | 455338882252 |
10 | 145043530031 |
11 | 56570322984 |
12 | 2413a95003b |
13 | 108a67520aa |
14 | 703d3c1451 |
15 | 3b8d8c5b3b |
hex | 21c544a12f |
145043530031 has 2 divisors, whose sum is σ = 145043530032. Its totient is φ = 145043530030.
The previous prime is 145043530013. The next prime is 145043530039. The reversal of 145043530031 is 130035340541.
Together with previous prime (145043530013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145043530031 - 226 = 144976421167 is a prime.
It is a super-2 number, since 2×1450435300312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 145043529976 and 145043530003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145043530039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72521765015 + 72521765016.
It is an arithmetic number, because the mean of its divisors is an integer number (72521765016).
Almost surely, 2145043530031 is an apocalyptic number.
145043530031 is a deficient number, since it is larger than the sum of its proper divisors (1).
145043530031 is an equidigital number, since it uses as much as digits as its factorization.
145043530031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 145043530031 its reverse (130035340541), we get a palindrome (275078870572).
The spelling of 145043530031 in words is "one hundred forty-five billion, forty-three million, five hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •