Base | Representation |
---|---|
bin | 10010101001110001… |
… | …11011110111010000 |
3 | 221211220101022210022 |
4 | 21110320323313100 |
5 | 131002110133000 |
6 | 4333405523012 |
7 | 503105556635 |
oct | 112470736720 |
9 | 27756338708 |
10 | 10014146000 |
11 | 42797a7121 |
12 | 1b35873468 |
13 | c379011a1 |
14 | 6adda618c |
15 | 3d9254585 |
hex | 254e3bdd0 |
10014146000 has 80 divisors (see below), whose sum is σ = 24252965568. Its totient is φ = 3999248000.
The previous prime is 10014145979. The next prime is 10014146167. The reversal of 10014146000 is 64141001.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 10014146000.
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, 1362335 + ... + 1369665.
Almost surely, 210014146000 is an apocalyptic number.
10014146000 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 10014146000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12126482784).
10014146000 is an abundant number, since it is smaller than the sum of its proper divisors (14238819568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10014146000 is an equidigital number, since it uses as much as digits as its factorization.
10014146000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8037 (or 8021 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10014146000 its reverse (64141001), we get a palindrome (10078287001).
The spelling of 10014146000 in words is "ten billion, fourteen million, one hundred forty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •