Base | Representation |
---|---|
bin | 1100011010001100… |
… | …1110001101100111 |
3 | 22121011002112100202 |
4 | 3012203032031213 |
5 | 23310231401043 |
6 | 1310313301115 |
7 | 145356033005 |
oct | 30643161547 |
9 | 8534075322 |
10 | 3331122023 |
11 | 145a371309 |
12 | 78b70479b |
13 | 41118ac28 |
14 | 23859ba75 |
15 | 14769e1b8 |
hex | c68ce367 |
3331122023 has 2 divisors, whose sum is σ = 3331122024. Its totient is φ = 3331122022.
The previous prime is 3331121987. The next prime is 3331122031. The reversal of 3331122023 is 3202211333.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3331122023 - 220 = 3330073447 is a prime.
It is a super-2 number, since 2×33311220232 = 22192747864231225058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3331121986 and 3331122004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3331112023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1665561011 + 1665561012.
It is an arithmetic number, because the mean of its divisors is an integer number (1665561012).
Almost surely, 23331122023 is an apocalyptic number.
3331122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
3331122023 is an equidigital number, since it uses as much as digits as its factorization.
3331122023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 3331122023 is about 57715.8732325865. The cubic root of 3331122023 is about 1493.4711832260.
Adding to 3331122023 its reverse (3202211333), we get a palindrome (6533333356).
The spelling of 3331122023 in words is "three billion, three hundred thirty-one million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •