Base | Representation |
---|---|
bin | 11111000111001000100… |
… | …01000110000110001000 |
3 | 10210012020011102120100220 |
4 | 33203210101012012020 |
5 | 120003233240413242 |
6 | 2135030001030040 |
7 | 140142234321504 |
oct | 17434421060610 |
9 | 3705204376326 |
10 | 1068981576072 |
11 | 38239725aaa3 |
12 | 153213925320 |
13 | 79a5c725087 |
14 | 39a4bab7304 |
15 | 1cc17756bec |
hex | f8e4446188 |
1068981576072 has 32 divisors (see below), whose sum is σ = 2675217652800. Its totient is φ = 355958697024.
The previous prime is 1068981576007. The next prime is 1068981576073. The reversal of 1068981576072 is 2706751898601.
It is a super-2 number, since 2×10689815760722 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1068981575997 and 1068981576015.
It is not an unprimeable number, because it can be changed into a prime (1068981576073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23007247 + ... + 23053662.
It is an arithmetic number, because the mean of its divisors is an integer number (83600551650).
Almost surely, 21068981576072 is an apocalyptic number.
1068981576072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1068981576072 is an abundant number, since it is smaller than the sum of its proper divisors (1606236076728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068981576072 is a wasteful number, since it uses less digits than its factorization.
1068981576072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46061885 (or 46061881 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 60.
The spelling of 1068981576072 in words is "one trillion, sixty-eight billion, nine hundred eighty-one million, five hundred seventy-six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •