Base | Representation |
---|---|
bin | 1101000111101… |
… | …10010111010101 |
3 | 21200002200022211 |
4 | 12203312113111 |
5 | 211133423023 |
6 | 14530553421 |
7 | 2504334406 |
oct | 643662725 |
9 | 250080284 |
10 | 110061013 |
11 | 57143517 |
12 | 30a38871 |
13 | 19a5707a |
14 | 1088d9ad |
15 | 99e0a0d |
hex | 68f65d5 |
110061013 has 4 divisors (see below), whose sum is σ = 111150828. Its totient is φ = 108971200.
The previous prime is 110061011. The next prime is 110061047. The reversal of 110061013 is 310160011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 91068849 + 18992164 = 9543^2 + 4358^2 .
It is a cyclic number.
It is not a de Polignac number, because 110061013 - 21 = 110061011 is a prime.
It is a super-2 number, since 2×1100610132 = 24226853165172338, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110060984 and 110061002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110061011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 544756 + ... + 544957.
It is an arithmetic number, because the mean of its divisors is an integer number (27787707).
Almost surely, 2110061013 is an apocalyptic number.
It is an amenable number.
110061013 is a deficient number, since it is larger than the sum of its proper divisors (1089815).
110061013 is a wasteful number, since it uses less digits than its factorization.
110061013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1089814.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 110061013 is about 10490.9967591264. The cubic root of 110061013 is about 479.2305568779.
The spelling of 110061013 in words is "one hundred ten million, sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •