Base | Representation |
---|---|
bin | 11110111000011000010… |
… | …00100111010111100001 |
3 | 10202102210010112120111012 |
4 | 33130030020213113201 |
5 | 114341022442211410 |
6 | 2131240001030305 |
7 | 136442032333124 |
oct | 17341410472741 |
9 | 3672703476435 |
10 | 1061060507105 |
11 | 379aa1aa3705 |
12 | 151783025395 |
13 | 79099659911 |
14 | 394d9ab83bb |
15 | 1c90214d605 |
hex | f70c2275e1 |
1061060507105 has 8 divisors (see below), whose sum is σ = 1273278876864. Its totient is φ = 848844226800.
The previous prime is 1061060507057. The next prime is 1061060507153. The reversal of 1061060507105 is 5017050601601.
1061060507105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1061060507057) and next prime (1061060507153).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1061060507105 - 210 = 1061060506081 is a prime.
It is a super-2 number, since 2×10610605071052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 996140 + ... + 1764770.
It is an arithmetic number, because the mean of its divisors is an integer number (159159859608).
Almost surely, 21061060507105 is an apocalyptic number.
It is an amenable number.
1061060507105 is a deficient number, since it is larger than the sum of its proper divisors (212218369759).
1061060507105 is an equidigital number, since it uses as much as digits as its factorization.
1061060507105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1044727.
The product of its (nonzero) digits is 6300, while the sum is 32.
The spelling of 1061060507105 in words is "one trillion, sixty-one billion, sixty million, five hundred seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •