Base | Representation |
---|---|
bin | 1000011101000100101… |
… | …1010000100010010111 |
3 | 111212220020220122012102 |
4 | 2013101023100202113 |
5 | 4334424241411411 |
6 | 150420204112315 |
7 | 13331156524025 |
oct | 2072113204227 |
9 | 455806818172 |
10 | 145243310231 |
11 | 56663075788 |
12 | 2419583569b |
13 | 10908c60326 |
14 | 705bb47715 |
15 | 3ba11d9d3b |
hex | 21d12d0897 |
145243310231 has 4 divisors (see below), whose sum is σ = 152887695000. Its totient is φ = 137598925464.
The previous prime is 145243310207. The next prime is 145243310249. The reversal of 145243310231 is 132013342541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145243310231 is a prime.
It is a super-2 number, since 2×1452433102312 (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 = 145243310194 and 145243310203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145243310281) 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, 3822192356 + ... + 3822192393.
It is an arithmetic number, because the mean of its divisors is an integer number (38221923750).
Almost surely, 2145243310231 is an apocalyptic number.
145243310231 is a deficient number, since it is larger than the sum of its proper divisors (7644384769).
145243310231 is an equidigital number, since it uses as much as digits as its factorization.
145243310231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7644384768.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 145243310231 its reverse (132013342541), we get a palindrome (277256652772).
The spelling of 145243310231 in words is "one hundred forty-five billion, two hundred forty-three million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •