Base | Representation |
---|---|
bin | 101011111110011110100… |
… | …111011000011101100111 |
3 | 101200220100222200100110212 |
4 | 223332132213120131213 |
5 | 344003100410224111 |
6 | 10232144231410035 |
7 | 431222356541030 |
oct | 53763647303547 |
9 | 11626328610425 |
10 | 3022023133031 |
11 | a656a6302571 |
12 | 40983152391b |
13 | 18bc8b3c1376 |
14 | a63a3b79a87 |
15 | 53922de198b |
hex | 2bf9e9d8767 |
3022023133031 has 16 divisors (see below), whose sum is σ = 3461998924800. Its totient is φ = 2584112747040.
The previous prime is 3022023133007. The next prime is 3022023133049. The reversal of 3022023133031 is 1303313202203.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3022023133031 is a prime.
It is a super-2 number, since 2×30220231330312 (a number of 26 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 = 3022023132988 and 3022023133006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022023133061) 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, 58826945 + ... + 58878293.
It is an arithmetic number, because the mean of its divisors is an integer number (216374932800).
Almost surely, 23022023133031 is an apocalyptic number.
3022023133031 is a deficient number, since it is larger than the sum of its proper divisors (439975791769).
3022023133031 is a wasteful number, since it uses less digits than its factorization.
3022023133031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71294.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 3022023133031 its reverse (1303313202203), we get a palindrome (4325336335234).
The spelling of 3022023133031 in words is "three trillion, twenty-two billion, twenty-three million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •