Base | Representation |
---|---|
bin | 110010011011001101… |
… | …1001001100000000000 |
3 | 101100111201121012221120 |
4 | 1210312123021200000 |
5 | 3233233020100424 |
6 | 121425123552240 |
7 | 10552313412135 |
oct | 1446633114000 |
9 | 340451535846 |
10 | 108287268864 |
11 | 41a19381935 |
12 | 18ba122b680 |
13 | a299713928 |
14 | 535394658c |
15 | 2c3ba7ba79 |
hex | 19366c9800 |
108287268864 has 96 divisors (see below), whose sum is σ = 288858875760. Its totient is φ = 36075339776.
The previous prime is 108287268853. The next prime is 108287268883. The reversal of 108287268864 is 468862782801.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1082872688642 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 108287268798 and 108287268807.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14108932 + ... + 14116604.
Almost surely, 2108287268864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 108287268864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144429437880).
108287268864 is an abundant number, since it is smaller than the sum of its proper divisors (180571606896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108287268864 is an equidigital number, since it uses as much as digits as its factorization.
108287268864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9995 (or 9975 counting only the distinct ones).
The product of its (nonzero) digits is 16515072, while the sum is 60.
The spelling of 108287268864 in words is "one hundred eight billion, two hundred eighty-seven million, two hundred sixty-eight thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •