Base | Representation |
---|---|
bin | 11111000011101011110… |
… | …11000001111100000001 |
3 | 10210000110010220220102120 |
4 | 33201311323001330001 |
5 | 114440440324014423 |
6 | 2134122145434453 |
7 | 140045324604615 |
oct | 17416573017401 |
9 | 3700403826376 |
10 | 1067130298113 |
11 | 381627262510 |
12 | 15299793ba29 |
13 | 79826020029 |
14 | 39913c93345 |
15 | 1cb59e6eee3 |
hex | f875ec1f01 |
1067130298113 has 32 divisors (see below), whose sum is σ = 1570231308672. Its totient is φ = 639268761600.
The previous prime is 1067130298099. The next prime is 1067130298121. The reversal of 1067130298113 is 3118920317601.
It is not a de Polignac number, because 1067130298113 - 25 = 1067130298081 is a prime.
It is a super-2 number, since 2×10671302981132 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1067130298163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 546873 + ... + 1559913.
It is an arithmetic number, because the mean of its divisors is an integer number (49069728396).
Almost surely, 21067130298113 is an apocalyptic number.
It is an amenable number.
1067130298113 is a deficient number, since it is larger than the sum of its proper divisors (503101010559).
1067130298113 is a wasteful number, since it uses less digits than its factorization.
1067130298113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013425.
The product of its (nonzero) digits is 54432, while the sum is 42.
The spelling of 1067130298113 in words is "one trillion, sixty-seven billion, one hundred thirty million, two hundred ninety-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •