Base | Representation |
---|---|
bin | 110100101011010001… |
… | …1001010111010101111 |
3 | 101210222121111212121121 |
4 | 1221112203022322233 |
5 | 3323133012210111 |
6 | 123544524041411 |
7 | 11113151264104 |
oct | 1512643127257 |
9 | 353877455547 |
10 | 113121210031 |
11 | 43a79a79435 |
12 | 19b10093267 |
13 | a88a04004b |
14 | 569193caab |
15 | 2e21130871 |
hex | 1a568caeaf |
113121210031 has 8 divisors (see below), whose sum is σ = 114306410160. Its totient is φ = 111941220288.
The previous prime is 113121210019. The next prime is 113121210053. The reversal of 113121210031 is 130012121311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113121210031 - 227 = 112986992303 is a prime.
It is a super-2 number, since 2×1131212100312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113121209987 and 113121210014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113121219031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1258941 + ... + 1345798.
It is an arithmetic number, because the mean of its divisors is an integer number (14288301270).
Almost surely, 2113121210031 is an apocalyptic number.
113121210031 is a deficient number, since it is larger than the sum of its proper divisors (1185200129).
113121210031 is a wasteful number, since it uses less digits than its factorization.
113121210031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2605193.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 113121210031 its reverse (130012121311), we get a palindrome (243133331342).
The spelling of 113121210031 in words is "one hundred thirteen billion, one hundred twenty-one million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •