Base | Representation |
---|---|
bin | 10000101101001… |
… | …11100000001100 |
3 | 100202201012010112 |
4 | 20112213200030 |
5 | 241334143300 |
6 | 21523455152 |
7 | 3321140651 |
oct | 1026474014 |
9 | 322635115 |
10 | 140146700 |
11 | 72122321 |
12 | 3ab274b8 |
13 | 2305c055 |
14 | 14881c28 |
15 | c484e35 |
hex | 85a780c |
140146700 has 36 divisors (see below), whose sum is σ = 304871112. Its totient is φ = 55920000.
The previous prime is 140146697. The next prime is 140146703. The reversal of 140146700 is 7641041.
It is an interprime number because it is at equal distance from previous prime (140146697) and next prime (140146703).
It is not an unprimeable number, because it can be changed into a prime (140146703) 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 11 ways as a sum of consecutive naturals, for example, 45200 + ... + 48200.
It is an arithmetic number, because the mean of its divisors is an integer number (8468642).
Almost surely, 2140146700 is an apocalyptic number.
140146700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140146700 is an abundant number, since it is smaller than the sum of its proper divisors (164724412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140146700 is a wasteful number, since it uses less digits than its factorization.
140146700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3482 (or 3475 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 140146700 is about 11838.3571495373. The cubic root of 140146700 is about 519.4307132744.
Adding to 140146700 its reverse (7641041), we get a palindrome (147787741).
The spelling of 140146700 in words is "one hundred forty million, one hundred forty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •