Base | Representation |
---|---|
bin | 11101011010100001111… |
… | …11000000000000000000 |
3 | 10120121201202012202202110 |
4 | 32231100333000000000 |
5 | 113024331024210122 |
6 | 2052144222215320 |
7 | 133006331212425 |
oct | 16552077000000 |
9 | 3517652182673 |
10 | 1010676006912 |
11 | 35a697291a00 |
12 | 143a61424540 |
13 | 743ca0445b0 |
14 | 36cba299d4c |
15 | 1b453b5790c |
hex | eb50fc0000 |
1010676006912 has 912 divisors, whose sum is σ = 3436302826880. Its totient is φ = 261598740480.
The previous prime is 1010676006877. The next prime is 1010676006943. The reversal of 1010676006912 is 2196006760101.
It is a tau number, because it is divible by the number of its divisors (912).
It is a Harshad number since it is a multiple of its sum of digits (39).
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, 23504093163 + ... + 23504093205.
Almost surely, 21010676006912 is an apocalyptic number.
1010676006912 is a gapful number since it is divisible by the number (12) 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 1010676006912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1718151413440).
1010676006912 is an abundant number, since it is smaller than the sum of its proper divisors (2425626819968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010676006912 is an equidigital number, since it uses as much as digits as its factorization.
1010676006912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 39.
The spelling of 1010676006912 in words is "one trillion, ten billion, six hundred seventy-six million, six thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •