Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0110110001010111101 |
3 | 101111221210020000212201 |
4 | 1212131012312022331 |
5 | 3300300030000221 |
6 | 122312104031501 |
7 | 10643102400103 |
oct | 1463506661275 |
9 | 344853200781 |
10 | 110010000061 |
11 | 42722860325 |
12 | 193a2162591 |
13 | a4b25bb7c0 |
14 | 5478667c73 |
15 | 2cdce20891 |
hex | 199d1b62bd |
110010000061 has 8 divisors (see below), whose sum is σ = 118620966744. Its totient is φ = 101420270400.
The previous prime is 110010000031. The next prime is 110010000073. The reversal of 110010000061 is 160000010011.
It can be written as a sum of positive squares in 4 ways, for example, as 11216080836 + 98793919225 = 105906^2 + 314315^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 110010000061 - 25 = 110010000029 is a prime.
It is a super-2 number, since 2×1100100000612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010000031) 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, 5298490 + ... + 5319211.
It is an arithmetic number, because the mean of its divisors is an integer number (14827620843).
Almost surely, 2110010000061 is an apocalyptic number.
It is an amenable number.
110010000061 is a deficient number, since it is larger than the sum of its proper divisors (8610966683).
110010000061 is a wasteful number, since it uses less digits than its factorization.
110010000061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10618511.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 110010000061 its reverse (160000010011), we get a palindrome (270010010072).
The spelling of 110010000061 in words is "one hundred ten billion, ten million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •