Base | Representation |
---|---|
bin | 11110000100100001100… |
… | …01110010011111100111 |
3 | 10122202220221211021120211 |
4 | 33002100301302133213 |
5 | 113412014101401043 |
6 | 2110353310240251 |
7 | 134435116426126 |
oct | 17022061623747 |
9 | 3582827737524 |
10 | 1033221122023 |
11 | 369206429642 |
12 | 1482b37b6087 |
13 | 76580ab64ac |
14 | 380185b7abd |
15 | 1bd23061a9d |
hex | f090c727e7 |
1033221122023 has 2 divisors, whose sum is σ = 1033221122024. Its totient is φ = 1033221122022.
The previous prime is 1033221121991. The next prime is 1033221122033. The reversal of 1033221122023 is 3202211223301.
It is a strong prime.
It is an emirp because it is prime and its reverse (3202211223301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033221122023 - 25 = 1033221121991 is a prime.
It is a super-2 number, since 2×10332211220232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1033221121985 and 1033221122003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033221122033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516610561011 + 516610561012.
It is an arithmetic number, because the mean of its divisors is an integer number (516610561012).
Almost surely, 21033221122023 is an apocalyptic number.
1033221122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033221122023 is an equidigital number, since it uses as much as digits as its factorization.
1033221122023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1033221122023 its reverse (3202211223301), we get a palindrome (4235432345324).
The spelling of 1033221122023 in words is "one trillion, thirty-three billion, two hundred twenty-one million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •