Base | Representation |
---|---|
bin | 10101011100001111… |
… | …001001011110100011 |
3 | 2012102110112120222110 |
4 | 111130033021132203 |
5 | 334122202430311 |
6 | 14324252010403 |
7 | 1443341263125 |
oct | 253417113643 |
9 | 65373476873 |
10 | 23022311331 |
11 | 9844549288 |
12 | 4566160a03 |
13 | 222b8a1636 |
14 | 1185859215 |
15 | 8eb26a8a6 |
hex | 55c3c97a3 |
23022311331 has 4 divisors (see below), whose sum is σ = 30696415112. Its totient is φ = 15348207552.
The previous prime is 23022311281. The next prime is 23022311363. The reversal of 23022311331 is 13311322032.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 23022311331 - 210 = 23022310307 is a prime.
It is a super-2 number, since 2×230223113312 (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 = 23022311298 and 23022311307.
It is not an unprimeable number, because it can be changed into a prime (23022310331) 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, 3837051886 + ... + 3837051891.
It is an arithmetic number, because the mean of its divisors is an integer number (7674103778).
Almost surely, 223022311331 is an apocalyptic number.
23022311331 is a deficient number, since it is larger than the sum of its proper divisors (7674103781).
23022311331 is an equidigital number, since it uses as much as digits as its factorization.
23022311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7674103780.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23022311331 its reverse (13311322032), we get a palindrome (36333633363).
The spelling of 23022311331 in words is "twenty-three billion, twenty-two million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •