Base | Representation |
---|---|
bin | 10000000111000010110… |
… | …000100011101100001010 |
3 | 10220211112220020111012100 |
4 | 100013002300203230022 |
5 | 121114241432312244 |
6 | 2204325520054230 |
7 | 142661220422451 |
oct | 20070260435412 |
9 | 3824486214170 |
10 | 1107074104074 |
11 | 39756451a0a4 |
12 | 15a684a64376 |
13 | 80520558a83 |
14 | 3b822bd3b98 |
15 | 1dbe6a56b69 |
hex | 101c2c23b0a |
1107074104074 has 96 divisors (see below), whose sum is σ = 2628038059920. Its totient is φ = 335251316736.
The previous prime is 1107074104069. The next prime is 1107074104093. The reversal of 1107074104074 is 4704014707011.
1107074104074 is a `hidden beast` number, since 110 + 70 + 74 + 1 + 0 + 407 + 4 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 665214778449 + 441859325625 = 815607^2 + 664725^2 .
It is a super-2 number, since 2×11070741040742 (a number of 25 digits) contains 22 as substring.
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, 38117062 + ... + 38146094.
Almost surely, 21107074104074 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1107074104074, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1314019029960).
1107074104074 is an abundant number, since it is smaller than the sum of its proper divisors (1520963955846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107074104074 is a wasteful number, since it uses less digits than its factorization.
1107074104074 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33384 (or 33381 counting only the distinct ones).
The product of its (nonzero) digits is 21952, while the sum is 36.
The spelling of 1107074104074 in words is "one trillion, one hundred seven billion, seventy-four million, one hundred four thousand, seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •