Base | Representation |
---|---|
bin | 1001001100011110111010… |
… | …0110010001000000111101 |
3 | 1022210111211112112012101001 |
4 | 2103013232212101000331 |
5 | 2311120401112243221 |
6 | 33300255315250301 |
7 | 2062266511030621 |
oct | 223075646210075 |
9 | 38714745465331 |
10 | 10110061056061 |
11 | 324871a99648a |
12 | 1173492ba9991 |
13 | 5844b41b1c75 |
14 | 26d488487181 |
15 | 127ebc59b391 |
hex | 931ee99103d |
10110061056061 has 8 divisors (see below), whose sum is σ = 10158652058040. Its totient is φ = 10061541777408.
The previous prime is 10110061056047. The next prime is 10110061056071. The reversal of 10110061056061 is 16065016001101.
It can be written as a sum of positive squares in 4 ways, for example, as 2511939708100 + 7598121347961 = 1584910^2 + 2756469^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10110061056061 - 213 = 10110061047869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110061056001) 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, 17648226 + ... + 18212083.
It is an arithmetic number, because the mean of its divisors is an integer number (1269831507255).
Almost surely, 210110061056061 is an apocalyptic number.
It is an amenable number.
10110061056061 is a deficient number, since it is larger than the sum of its proper divisors (48591001979).
10110061056061 is a wasteful number, since it uses less digits than its factorization.
10110061056061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35861663.
The product of its (nonzero) digits is 1080, while the sum is 28.
Adding to 10110061056061 its reverse (16065016001101), we get a palindrome (26175077057162).
The spelling of 10110061056061 in words is "ten trillion, one hundred ten billion, sixty-one million, fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •