Base | Representation |
---|---|
bin | 11011110001011111… |
… | …00101101100111000 |
3 | 1102111011000010221001 |
4 | 31320233211230320 |
5 | 221014111034000 |
6 | 10503322454344 |
7 | 1035333242251 |
oct | 157057455470 |
9 | 42434003831 |
10 | 14910643000 |
11 | 636173a860 |
12 | 2a816643b4 |
13 | 15381909a6 |
14 | a16403b28 |
15 | 5c406346a |
hex | 378be5b38 |
14910643000 has 64 divisors (see below), whose sum is σ = 38062833120. Its totient is φ = 5422048000.
The previous prime is 14910642953. The next prime is 14910643051. The reversal of 14910643000 is 34601941.
It is a self number, because there is not a number n which added to its sum of digits gives 14910643000.
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, 666757 + ... + 688756.
Almost surely, 214910643000 is an apocalyptic number.
14910643000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14910643000 is an abundant number, since it is smaller than the sum of its proper divisors (23152190120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14910643000 is a wasteful number, since it uses less digits than its factorization.
14910643000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1355545 (or 1355531 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 14910643000 in words is "fourteen billion, nine hundred ten million, six hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •