Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …110110010111101001100101 |
3 | 112102111000002012201200021020 |
4 | 121000232200312113221211 |
5 | 103404224231120300221 |
6 | 1025541451021441353 |
7 | 32112213644545446 |
oct | 3100564066275145 |
9 | 472430065650236 |
10 | 110001106025061 |
11 | 320602306a0199 |
12 | 10406b4ba10259 |
13 | 494c0a1481664 |
14 | 1d24120bab2cd |
15 | cab5ab888ac6 |
hex | 640ba0d97a65 |
110001106025061 has 8 divisors (see below), whose sum is σ = 149788740119424. Its totient is φ = 71773771307040.
The previous prime is 110001106025039. The next prime is 110001106025141. The reversal of 110001106025061 is 160520601100011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110001106025061 - 29 = 110001106024549 is a prime.
It is a super-2 number, since 2×1100011060250612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110001106025021) 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, 390074843920 + ... + 390074844201.
It is an arithmetic number, because the mean of its divisors is an integer number (18723592514928).
Almost surely, 2110001106025061 is an apocalyptic number.
It is an amenable number.
110001106025061 is a deficient number, since it is larger than the sum of its proper divisors (39787634094363).
110001106025061 is an equidigital number, since it uses as much as digits as its factorization.
110001106025061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 780149688171.
The product of its (nonzero) digits is 360, while the sum is 24.
Adding to 110001106025061 its reverse (160520601100011), we get a palindrome (270521707125072).
The spelling of 110001106025061 in words is "one hundred ten trillion, one billion, one hundred six million, twenty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •