Base | Representation |
---|---|
bin | 110100101000010100… |
… | …1111110100011111011 |
3 | 101210201201110022021010 |
4 | 1221100221332203323 |
5 | 3322432204044011 |
6 | 123531032445003 |
7 | 11110540651323 |
oct | 1512051764373 |
9 | 353651408233 |
10 | 113022331131 |
11 | 43a29183236 |
12 | 19aa2b49763 |
13 | a8726cc918 |
14 | 5682760283 |
15 | 2e175ed1a6 |
hex | 1a50a7e8fb |
113022331131 has 16 divisors (see below), whose sum is σ = 157953632256. Its totient is φ = 71749007616.
The previous prime is 113022331111. The next prime is 113022331133. The reversal of 113022331131 is 131133220311.
It is a happy number.
It is not a de Polignac number, because 113022331131 - 210 = 113022330107 is a prime.
It is a super-2 number, since 2×1130223311312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113022331098 and 113022331107.
It is not an unprimeable number, because it can be changed into a prime (113022331133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3657270 + ... + 3688043.
It is an arithmetic number, because the mean of its divisors is an integer number (9872102016).
Almost surely, 2113022331131 is an apocalyptic number.
113022331131 is a deficient number, since it is larger than the sum of its proper divisors (44931301125).
113022331131 is a wasteful number, since it uses less digits than its factorization.
113022331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7345562.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113022331131 its reverse (131133220311), we get a palindrome (244155551442).
It can be divided in two parts, 113022 and 331131, that added together give a triangular number (444153 = T942).
The spelling of 113022331131 in words is "one hundred thirteen billion, twenty-two million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •