Base | Representation |
---|---|
bin | 11100111001000011… |
… | …101010100011101011 |
3 | 2222001222102120021001 |
4 | 130321003222203223 |
5 | 1002013120030011 |
6 | 22130141455431 |
7 | 2145516634165 |
oct | 347103524353 |
9 | 88058376231 |
10 | 31022033131 |
11 | 1217a146711 |
12 | 6019271577 |
13 | 2c05047c2b |
14 | 170408d935 |
15 | c1870d7c1 |
hex | 7390ea8eb |
31022033131 has 4 divisors (see below), whose sum is σ = 31023301792. Its totient is φ = 31020764472.
The previous prime is 31022033129. The next prime is 31022033167. The reversal of 31022033131 is 13133022013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31022033131 - 21 = 31022033129 is a prime.
It is a super-2 number, since 2×310220331312 (a number of 22 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 = 31022033099 and 31022033108.
It is not an unprimeable number, because it can be changed into a prime (31022033111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 596916 + ... + 646801.
It is an arithmetic number, because the mean of its divisors is an integer number (7755825448).
Almost surely, 231022033131 is an apocalyptic number.
31022033131 is a deficient number, since it is larger than the sum of its proper divisors (1268661).
31022033131 is a wasteful number, since it uses less digits than its factorization.
31022033131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268660.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 31022033131 its reverse (13133022013), we get a palindrome (44155055144).
The spelling of 31022033131 in words is "thirty-one billion, twenty-two million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •