Base | Representation |
---|---|
bin | 10101001111101110111… |
… | …101000001000101110000 |
3 | 12011120112010000020001222 |
4 | 111033232331001011300 |
5 | 142410041214323000 |
6 | 3034414400444212 |
7 | 210324142524521 |
oct | 25175675010560 |
9 | 5146463006058 |
10 | 1460002886000 |
11 | 51320262667a |
12 | 1b6b60019668 |
13 | a78a6b34849 |
14 | 50943610848 |
15 | 27ea0c82a85 |
hex | 153eef41170 |
1460002886000 has 80 divisors (see below), whose sum is σ = 3532192966848. Its totient is φ = 583685856000.
The previous prime is 1460002885997. The next prime is 1460002886149. The reversal of 1460002886000 is 6882000641.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3525869 + ... + 3918131.
Almost surely, 21460002886000 is an apocalyptic number.
1460002886000 is a gapful number since it is divisible by the number (10) 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 1460002886000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1766096483424).
1460002886000 is an abundant number, since it is smaller than the sum of its proper divisors (2072190080848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1460002886000 is a wasteful number, since it uses less digits than its factorization.
1460002886000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394147 (or 394131 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 35.
Adding to 1460002886000 its reverse (6882000641), we get a palindrome (1466884886641).
The spelling of 1460002886000 in words is "one trillion, four hundred sixty billion, two million, eight hundred eighty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •