Base | Representation |
---|---|
bin | 10000101111101… |
… | …00000110111010 |
3 | 100210022010112210 |
4 | 20113310012322 |
5 | 241424213344 |
6 | 21534315550 |
7 | 3323615520 |
oct | 1027640672 |
9 | 323263483 |
10 | 140460474 |
11 | 72317040 |
12 | 3b058bb6 |
13 | 2313bb0b |
14 | 14924310 |
15 | c4e7db9 |
hex | 85f41ba |
140460474 has 64 divisors (see below), whose sum is σ = 356244480. Its totient is φ = 35857920.
The previous prime is 140460451. The next prime is 140460479. The reversal of 140460474 is 474064041.
140460474 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140460479) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24682 + ... + 29834.
It is an arithmetic number, because the mean of its divisors is an integer number (5566320).
Almost surely, 2140460474 is an apocalyptic number.
140460474 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 140460474, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178122240).
140460474 is an abundant number, since it is smaller than the sum of its proper divisors (215784006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140460474 is a wasteful number, since it uses less digits than its factorization.
140460474 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5235.
The product of its (nonzero) digits is 10752, while the sum is 30.
The square root of 140460474 is about 11851.6021701709. The cubic root of 140460474 is about 519.8180749200.
The spelling of 140460474 in words is "one hundred forty million, four hundred sixty thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •