Base | Representation |
---|---|
bin | 10001010111101… |
… | …00011101111111 |
3 | 101011011120110020 |
4 | 20223310131333 |
5 | 244300023311 |
6 | 22242543223 |
7 | 3416320266 |
oct | 1053643577 |
9 | 334146406 |
10 | 145704831 |
11 | 75279218 |
12 | 40967b13 |
13 | 24256b9c |
14 | 154cb5dd |
15 | cbd1c06 |
hex | 8af477f |
145704831 has 8 divisors (see below), whose sum is σ = 194451504. Its totient is φ = 97047360.
The previous prime is 145704821. The next prime is 145704859. The reversal of 145704831 is 138407541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145704831 - 27 = 145704703 is a prime.
It is a super-2 number, since 2×1457048312 = 42459795553477122, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 145704792 and 145704801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145704821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18390 + ... + 25091.
It is an arithmetic number, because the mean of its divisors is an integer number (24306438).
Almost surely, 2145704831 is an apocalyptic number.
145704831 is a deficient number, since it is larger than the sum of its proper divisors (48746673).
145704831 is a wasteful number, since it uses less digits than its factorization.
145704831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44601.
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 145704831 is about 12070.8256138509. The cubic root of 145704831 is about 526.2086511446.
The spelling of 145704831 in words is "one hundred forty-five million, seven hundred four thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •