Base | Representation |
---|---|
bin | 110100101101100111… |
… | …1110100000111111101 |
3 | 101211012002210221022220 |
4 | 1221123033310013331 |
5 | 3323313201201023 |
6 | 124000421155553 |
7 | 11115126211461 |
oct | 1513317640775 |
9 | 354162727286 |
10 | 113200022013 |
11 | 4400a509001 |
12 | 19b3255bbb9 |
13 | a8a0475760 |
14 | 569c1b64a1 |
15 | 2e27eec3e3 |
hex | 1a5b3f41fd |
113200022013 has 16 divisors (see below), whose sum is σ = 162874694976. Its totient is φ = 69519663360.
The previous prime is 113200022011. The next prime is 113200022071. The reversal of 113200022013 is 310220002311.
It is not a de Polignac number, because 113200022013 - 21 = 113200022011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113200021983 and 113200022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113200022011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2936620 + ... + 2974917.
It is an arithmetic number, because the mean of its divisors is an integer number (10179668436).
Almost surely, 2113200022013 is an apocalyptic number.
113200022013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113200022013 is a deficient number, since it is larger than the sum of its proper divisors (49674672963).
113200022013 is a wasteful number, since it uses less digits than its factorization.
113200022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5912044.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 113200022013 its reverse (310220002311), we get a palindrome (423420024324).
The spelling of 113200022013 in words is "one hundred thirteen billion, two hundred million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •