Base | Representation |
---|---|
bin | 101101010001100011010… |
… | …010001001001111011011 |
3 | 102000102121102010110102011 |
4 | 231101203102021033123 |
5 | 401433240314220011 |
6 | 10341135313250351 |
7 | 440530660566145 |
oct | 55214322111733 |
9 | 12012542113364 |
10 | 3111222023131 |
11 | a9a5097a4962 |
12 | 422b85b639b7 |
13 | 197505262501 |
14 | aa8264ddc95 |
15 | 55de3c77621 |
hex | 2d4634893db |
3111222023131 has 16 divisors (see below), whose sum is σ = 3258008208000. Its totient is φ = 2967292137600.
The previous prime is 3111222023083. The next prime is 3111222023141. The reversal of 3111222023131 is 1313202221113.
3111222023131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3111222023131 - 227 = 3111087805403 is a prime.
It is a super-2 number, since 2×31112220231312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3111222023141) 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, 1206915 + ... + 2771116.
It is an arithmetic number, because the mean of its divisors is an integer number (203625513000).
Almost surely, 23111222023131 is an apocalyptic number.
3111222023131 is a deficient number, since it is larger than the sum of its proper divisors (146786184869).
3111222023131 is a wasteful number, since it uses less digits than its factorization.
3111222023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3978390.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 3111222023131 its reverse (1313202221113), we get a palindrome (4424424244244).
The spelling of 3111222023131 in words is "three trillion, one hundred eleven billion, two hundred twenty-two million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •