Base | Representation |
---|---|
bin | 10000110000001… |
… | …00101101101010 |
3 | 100210102120211220 |
4 | 20120010231222 |
5 | 241433402430 |
6 | 21540002510 |
7 | 3324321024 |
oct | 1030045552 |
9 | 323376756 |
10 | 140528490 |
11 | 72363153 |
12 | 3b090436 |
13 | 23163a6b |
14 | 14941014 |
15 | c50d110 |
hex | 8604b6a |
140528490 has 32 divisors (see below), whose sum is σ = 348900480. Its totient is φ = 36181824.
The previous prime is 140528483. The next prime is 140528497. The reversal of 140528490 is 94825041.
140528490 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (140528483) and next prime (140528497).
It is not an unprimeable number, because it can be changed into a prime (140528497) 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 15 ways as a sum of consecutive naturals, for example, 79894 + ... + 81633.
It is an arithmetic number, because the mean of its divisors is an integer number (10903140).
Almost surely, 2140528490 is an apocalyptic number.
140528490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140528490 is an abundant number, since it is smaller than the sum of its proper divisors (208371990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140528490 is a wasteful number, since it uses less digits than its factorization.
140528490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161566.
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 140528490 is about 11854.4713083292. The cubic root of 140528490 is about 519.9019662332.
The spelling of 140528490 in words is "one hundred forty million, five hundred twenty-eight thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •