Base | Representation |
---|---|
bin | 10001010101101… |
… | …10010110111111 |
3 | 101010200122111000 |
4 | 20222312112333 |
5 | 244213403211 |
6 | 22233301343 |
7 | 3414210510 |
oct | 1052662677 |
9 | 333618430 |
10 | 145450431 |
11 | 75115075 |
12 | 40864853 |
13 | 24198159 |
14 | 15462a07 |
15 | cb81656 |
hex | 8ab65bf |
145450431 has 16 divisors (see below), whose sum is σ = 246265600. Its totient is φ = 83114424.
The previous prime is 145450369. The next prime is 145450439. The reversal of 145450431 is 134054541.
It is a happy number.
It is not a de Polignac number, because 145450431 - 27 = 145450303 is a prime.
It is a super-2 number, since 2×1454504312 = 42311655756171522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 145450395 and 145450404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145450439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384601 + ... + 384978.
It is an arithmetic number, because the mean of its divisors is an integer number (15391600).
Almost surely, 2145450431 is an apocalyptic number.
145450431 is a deficient number, since it is larger than the sum of its proper divisors (100815169).
145450431 is an equidigital number, since it uses as much as digits as its factorization.
145450431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769595 (or 769589 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 145450431 is about 12060.2832056300. The cubic root of 145450431 is about 525.9022200622.
The spelling of 145450431 in words is "one hundred forty-five million, four hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •