Base | Representation |
---|---|
bin | 10001010011000… |
… | …10100101010001 |
3 | 101010001012202202 |
4 | 20221202211101 |
5 | 244121413111 |
6 | 22222052545 |
7 | 3411251204 |
oct | 1051424521 |
9 | 333035682 |
10 | 145107281 |
11 | 74a00280 |
12 | 4071a155 |
13 | 240a7bc7 |
14 | 153b393b |
15 | cb14b3b |
hex | 8a62951 |
145107281 has 8 divisors (see below), whose sum is σ = 158873664. Its totient is φ = 131436720.
The previous prime is 145107251. The next prime is 145107289. The reversal of 145107281 is 182701541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145107281 - 26 = 145107217 is a prime.
It is a super-2 number, since 2×1451072812 = 42112245998425922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145107289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20765 + ... + 26858.
It is an arithmetic number, because the mean of its divisors is an integer number (19859208).
Almost surely, 2145107281 is an apocalyptic number.
145107281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
145107281 is a deficient number, since it is larger than the sum of its proper divisors (13766383).
145107281 is a wasteful number, since it uses less digits than its factorization.
145107281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47911.
The product of its (nonzero) digits is 2240, while the sum is 29.
The square root of 145107281 is about 12046.0483562038. The cubic root of 145107281 is about 525.4883208627.
The spelling of 145107281 in words is "one hundred forty-five million, one hundred seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •