Base | Representation |
---|---|
bin | 1011011011100011101100… |
… | …1111000001011111010100 |
3 | 1122111111101021102200012111 |
4 | 2312320323033001133110 |
5 | 3121403400413231400 |
6 | 42421405113000404 |
7 | 2435004305140210 |
oct | 266707317013724 |
9 | 48444337380174 |
10 | 12568068102100 |
11 | 40060a6881935 |
12 | 14ab9386b3104 |
13 | 702218963644 |
14 | 316425009940 |
15 | 16bdce7553ba |
hex | b6e3b3c17d4 |
12568068102100 has 144 divisors (see below), whose sum is σ = 31843866862080. Its totient is φ = 4215794457600.
The previous prime is 12568068102077. The next prime is 12568068102131. The reversal of 12568068102100 is 120186086521.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 89714110 + ... + 89854090.
It is an arithmetic number, because the mean of its divisors is an integer number (221137964320).
Almost surely, 212568068102100 is an apocalyptic number.
12568068102100 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 12568068102100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15921933431040).
12568068102100 is an abundant number, since it is smaller than the sum of its proper divisors (19275798759980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12568068102100 is a wasteful number, since it uses less digits than its factorization.
12568068102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142778 (or 142771 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 40.
The spelling of 12568068102100 in words is "twelve trillion, five hundred sixty-eight billion, sixty-eight million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •