Base | Representation |
---|---|
bin | 101011100001111… |
… | …1010001111001100 |
3 | 10202210110100012011 |
4 | 1113003322033030 |
5 | 10442411032024 |
6 | 400534351004 |
7 | 51124154500 |
oct | 12703721714 |
9 | 3683410164 |
10 | 1460642764 |
11 | 68a549589 |
12 | 3491bb464 |
13 | 1a37c2179 |
14 | dbdba300 |
15 | 88373094 |
hex | 570fa3cc |
1460642764 has 36 divisors (see below), whose sum is σ = 2985988320. Its totient is φ = 623350560.
The previous prime is 1460642759. The next prime is 1460642773. The reversal of 1460642764 is 4672460641.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31254 + ... + 62434.
It is an arithmetic number, because the mean of its divisors is an integer number (82944120).
Almost surely, 21460642764 is an apocalyptic number.
1460642764 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1460642764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1492994160).
1460642764 is an abundant number, since it is smaller than the sum of its proper divisors (1525345556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1460642764 is a wasteful number, since it uses less digits than its factorization.
1460642764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31438 (or 31429 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 40.
The square root of 1460642764 is about 38218.3563749149. The cubic root of 1460642764 is about 1134.6136494801.
The spelling of 1460642764 in words is "one billion, four hundred sixty million, six hundred forty-two thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •