Base | Representation |
---|---|
bin | 1001001100110101101110… |
… | …0111010101111100111111 |
3 | 1022211002122022211220201101 |
4 | 2103031123213111330333 |
5 | 2311220421331203041 |
6 | 33303151121153531 |
7 | 2062604331626536 |
oct | 223153347257477 |
9 | 38732568756641 |
10 | 10116185022271 |
11 | 3250282797989 |
12 | 1174701a8b8a7 |
13 | 584c4bb63003 |
14 | 26d8a992531d |
15 | 12822a01eb31 |
hex | 9335b9d5f3f |
10116185022271 has 8 divisors (see below), whose sum is σ = 10351543237200. Its totient is φ = 9880831266432.
The previous prime is 10116185022221. The next prime is 10116185022301. The reversal of 10116185022271 is 17222058161101.
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 10116185022271 - 27 = 10116185022143 is a prime.
It is a super-2 number, since 2×101161850222712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10116185022271.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10116185022211) 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, 3716055 + ... + 5834503.
It is an arithmetic number, because the mean of its divisors is an integer number (1293942904650).
Almost surely, 210116185022271 is an apocalyptic number.
10116185022271 is a deficient number, since it is larger than the sum of its proper divisors (235358214929).
10116185022271 is a wasteful number, since it uses less digits than its factorization.
10116185022271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2229545.
The product of its (nonzero) digits is 13440, while the sum is 37.
The spelling of 10116185022271 in words is "ten trillion, one hundred sixteen billion, one hundred eighty-five million, twenty-two thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •