Base | Representation |
---|---|
bin | 1000011101010101100… |
… | …1110001010001111111 |
3 | 111220002012100101112211 |
4 | 2013111121301101333 |
5 | 4340100420120411 |
6 | 150431220041251 |
7 | 13333010342332 |
oct | 2072531612177 |
9 | 456065311484 |
10 | 145314223231 |
11 | 5669a0aa771 |
12 | 241b5533227 |
13 | 1091a85b598 |
14 | 7067326619 |
15 | 3ba7546221 |
hex | 21d567147f |
145314223231 has 4 divisors (see below), whose sum is σ = 145330376464. Its totient is φ = 145298070000.
The previous prime is 145314223099. The next prime is 145314223253. The reversal of 145314223231 is 132322413541.
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-145314223231 is a prime.
It is a super-2 number, since 2×1453142232312 (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 = 145314223193 and 145314223202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145314923231) 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, 8063115 + ... + 8081116.
It is an arithmetic number, because the mean of its divisors is an integer number (36332594116).
Almost surely, 2145314223231 is an apocalyptic number.
145314223231 is a deficient number, since it is larger than the sum of its proper divisors (16153233).
145314223231 is an equidigital number, since it uses as much as digits as its factorization.
145314223231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16153232.
The product of its digits is 17280, while the sum is 31.
Adding to 145314223231 its reverse (132322413541), we get a palindrome (277636636772).
The spelling of 145314223231 in words is "one hundred forty-five billion, three hundred fourteen million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •