Base | Representation |
---|---|
bin | 101110100100001111… |
… | …1100000001111001010 |
3 | 100120010012112000022000 |
4 | 1131020133200033022 |
5 | 3114300104401431 |
6 | 113534541011430 |
7 | 10140050635500 |
oct | 1351037401712 |
9 | 316105460260 |
10 | 100000465866 |
11 | 39456724114 |
12 | 17469b53b76 |
13 | 95789437c2 |
14 | 4ba9142670 |
15 | 29042cc9e6 |
hex | 17487e03ca |
100000465866 has 384 divisors, whose sum is σ = 286032384000. Its totient is φ = 25700830848.
The previous prime is 100000465837. The next prime is 100000465907. The reversal of 100000465866 is 668564000001.
It is a super-2 number, since 2×1000004658662 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100000465866.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 227791275 + ... + 227791713.
It is an arithmetic number, because the mean of its divisors is an integer number (744876000).
Almost surely, 2100000465866 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100000465866, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143016192000).
100000465866 is an abundant number, since it is smaller than the sum of its proper divisors (186031918134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000465866 is a wasteful number, since it uses less digits than its factorization.
100000465866 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703 (or 690 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 100000465866 its reverse (668564000001), we get a palindrome (768564465867).
The spelling of 100000465866 in words is "one hundred billion, four hundred sixty-five thousand, eight hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •