Base | Representation |
---|---|
bin | 10011010110101110011… |
… | …100110011100000110110 |
3 | 11201011010222112010120000 |
4 | 103112232130303200312 |
5 | 133242441322243303 |
6 | 2455005420052130 |
7 | 165044262515100 |
oct | 23265634634066 |
9 | 4634128463500 |
10 | 1330071681078 |
11 | 473097875288 |
12 | 19593a394046 |
13 | 9856b29927a |
14 | 48539332570 |
15 | 248e8eacda3 |
hex | 135ae733836 |
1330071681078 has 120 divisors (see below), whose sum is σ = 3467546755200. Its totient is φ = 379953195552.
The previous prime is 1330071681077. The next prime is 1330071681229. The reversal of 1330071681078 is 8701861700331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330071681077) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 60230443 + ... + 60252521.
It is an arithmetic number, because the mean of its divisors is an integer number (28896222960).
Almost surely, 21330071681078 is an apocalyptic number.
1330071681078 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1330071681078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1733773377600).
1330071681078 is an abundant number, since it is smaller than the sum of its proper divisors (2137475074122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330071681078 is a wasteful number, since it uses less digits than its factorization.
1330071681078 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29696 (or 29680 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 45.
The spelling of 1330071681078 in words is "one trillion, three hundred thirty billion, seventy-one million, six hundred eighty-one thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •