Base | Representation |
---|---|
bin | 110011010101001001… |
… | …0101010000100001101 |
3 | 101112112012110011011112 |
4 | 1212222102222010031 |
5 | 3301223141400023 |
6 | 122350045101405 |
7 | 10651426511654 |
oct | 1465222520415 |
9 | 345465404145 |
10 | 110231200013 |
11 | 42826703100 |
12 | 19444257865 |
13 | a51938944c |
14 | 5499ba819b |
15 | 2d02566478 |
hex | 19aa4aa10d |
110231200013 has 12 divisors (see below), whose sum is σ = 121522799580. Its totient is φ = 99912785280.
The previous prime is 110231200003. The next prime is 110231200019. The reversal of 110231200013 is 310002132011.
It can be written as a sum of positive squares in 2 ways, for example, as 39737232964 + 70493967049 = 199342^2 + 265507^2 .
It is not a de Polignac number, because 110231200013 - 222 = 110227005709 is a prime.
It is a super-2 number, since 2×1102312000132 (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 (110231200019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1310858 + ... + 1392411.
It is an arithmetic number, because the mean of its divisors is an integer number (10126899965).
Almost surely, 2110231200013 is an apocalyptic number.
It is an amenable number.
110231200013 is a deficient number, since it is larger than the sum of its proper divisors (11291599567).
110231200013 is a wasteful number, since it uses less digits than its factorization.
110231200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2703628 (or 2703617 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 110231200013 its reverse (310002132011), we get a palindrome (420233332024).
The spelling of 110231200013 in words is "one hundred ten billion, two hundred thirty-one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •