Base | Representation |
---|---|
bin | 10001010010100… |
… | …00010011101111 |
3 | 101002220102002112 |
4 | 20221100103233 |
5 | 244112014211 |
6 | 22220314235 |
7 | 3410520035 |
oct | 1051202357 |
9 | 332812075 |
10 | 145032431 |
11 | 7495a015 |
12 | 406a297b |
13 | 2407cb0b |
14 | 15394555 |
15 | caec88b |
hex | 8a504ef |
145032431 has 2 divisors, whose sum is σ = 145032432. Its totient is φ = 145032430.
The previous prime is 145032413. The next prime is 145032439. The reversal of 145032431 is 134230541.
Together with previous prime (145032413) 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 145032431 - 218 = 144770287 is a prime.
It is a super-2 number, since 2×1450324312 = 42068812083539522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145032397 and 145032406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145032439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72516215 + 72516216.
It is an arithmetic number, because the mean of its divisors is an integer number (72516216).
Almost surely, 2145032431 is an apocalyptic number.
145032431 is a deficient number, since it is larger than the sum of its proper divisors (1).
145032431 is an equidigital number, since it uses as much as digits as its factorization.
145032431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 145032431 is about 12042.9411274821. The cubic root of 145032431 is about 525.3979519407.
Adding to 145032431 its reverse (134230541), we get a palindrome (279262972).
The spelling of 145032431 in words is "one hundred forty-five million, thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •