Base | Representation |
---|---|
bin | 110100101011100010… |
… | …1000101010111110101 |
3 | 101211000020020112122121 |
4 | 1221113011011113311 |
5 | 3323142301201323 |
6 | 123545442355541 |
7 | 11113316662024 |
oct | 1512705052765 |
9 | 354006215577 |
10 | 113130100213 |
11 | 43a83aa0799 |
12 | 19b1305bbb1 |
13 | a88bb33700 |
14 | 5692bb48bb |
15 | 2e21cd9a5d |
hex | 1a571455f5 |
113130100213 has 12 divisors (see below), whose sum is σ = 122525350788. Its totient is φ = 104407729920.
The previous prime is 113130100199. The next prime is 113130100267. The reversal of 113130100213 is 312001031311.
It can be written as a sum of positive squares in 6 ways, for example, as 2492705329 + 110637394884 = 49927^2 + 332622^2 .
It is not a de Polignac number, because 113130100213 - 221 = 113128003061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113130100283) 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, 857293 + ... + 980413.
It is an arithmetic number, because the mean of its divisors is an integer number (10210445899).
Almost surely, 2113130100213 is an apocalyptic number.
113130100213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113130100213 is a deficient number, since it is larger than the sum of its proper divisors (9395250575).
113130100213 is a wasteful number, since it uses less digits than its factorization.
113130100213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128584 (or 128571 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 113130100213 its reverse (312001031311), we get a palindrome (425131131524).
The spelling of 113130100213 in words is "one hundred thirteen billion, one hundred thirty million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •