Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0010100011101110101 |
3 | 101112012202101121101200 |
4 | 1212203010110131311 |
5 | 3301001130013023 |
6 | 122330035243113 |
7 | 10645425365055 |
oct | 1464304243565 |
9 | 345182347350 |
10 | 110110001013 |
11 | 42774252541 |
12 | 1940b749499 |
13 | a4ca23286c |
14 | 5487a59565 |
15 | 2ce6ac5743 |
hex | 19a3114775 |
110110001013 has 24 divisors (see below), whose sum is σ = 163079070336. Its totient is φ = 71558520000.
The previous prime is 110110001003. The next prime is 110110001051. The reversal of 110110001013 is 310100011011.
It is not a de Polignac number, because 110110001013 - 28 = 110110000757 is a prime.
It is a super-2 number, since 2×1101100010132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110110000986 and 110110001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110001003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 412368 + ... + 624713.
It is an arithmetic number, because the mean of its divisors is an integer number (6794961264).
Almost surely, 2110110001013 is an apocalyptic number.
It is an amenable number.
110110001013 is a deficient number, since it is larger than the sum of its proper divisors (52969069323).
110110001013 is a wasteful number, since it uses less digits than its factorization.
110110001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1037385 (or 1037382 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 110110001013 its reverse (310100011011), we get a palindrome (420210012024).
The spelling of 110110001013 in words is "one hundred ten billion, one hundred ten million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •