Base | Representation |
---|---|
bin | 110100101000010011… |
… | …0000101100000011101 |
3 | 101210201122112110220200 |
4 | 1221100212011200131 |
5 | 3322431423423010 |
6 | 123530554534113 |
7 | 11110526202231 |
oct | 1512046054035 |
9 | 353648473820 |
10 | 113021311005 |
11 | 43a28646859 |
12 | 19aa2737339 |
13 | a8724334b5 |
14 | 56825765c1 |
15 | 2e1749acc0 |
hex | 1a5098581d |
113021311005 has 12 divisors (see below), whose sum is σ = 195903605820. Its totient is φ = 60278032512.
The previous prime is 113021310977. The next prime is 113021311043. The reversal of 113021311005 is 500113120311.
It can be written as a sum of positive squares in 2 ways, for example, as 23440222404 + 89581088601 = 153102^2 + 299301^2 .
It is not a de Polignac number, because 113021311005 - 25 = 113021310973 is a prime.
It is a super-2 number, since 2×1130213110052 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1255792300 + ... + 1255792389.
It is an arithmetic number, because the mean of its divisors is an integer number (16325300485).
Almost surely, 2113021311005 is an apocalyptic number.
113021311005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
113021311005 is a deficient number, since it is larger than the sum of its proper divisors (82882294815).
113021311005 is a wasteful number, since it uses less digits than its factorization.
113021311005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2511584700 (or 2511584697 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 113021311005 its reverse (500113120311), we get a palindrome (613134431316).
The spelling of 113021311005 in words is "one hundred thirteen billion, twenty-one million, three hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •