Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …00110001111111010001 |
3 | 10112121110110022221002012 |
4 | 32203123100301333101 |
5 | 112341211410201113 |
6 | 2043240014032305 |
7 | 132153453265304 |
oct | 16433320617721 |
9 | 3477413287065 |
10 | 1000111022033 |
11 | 356165665442 |
12 | 1419b31a8695 |
13 | 7340529b156 |
14 | 365970a6b3b |
15 | 1b036396aa8 |
hex | e8db431fd1 |
1000111022033 has 2 divisors, whose sum is σ = 1000111022034. Its totient is φ = 1000111022032.
The previous prime is 1000111022021. The next prime is 1000111022059. The reversal of 1000111022033 is 3302201110001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 860389815184 + 139721206849 = 927572^2 + 373793^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000111022033 - 24 = 1000111022017 is a prime.
It is a super-2 number, since 2×10001110220332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000111021999 and 1000111022017.
It is not a weakly prime, because it can be changed into another prime (1000111022003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500055511016 + 500055511017.
It is an arithmetic number, because the mean of its divisors is an integer number (500055511017).
Almost surely, 21000111022033 is an apocalyptic number.
It is an amenable number.
1000111022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111022033 is an equidigital number, since it uses as much as digits as its factorization.
1000111022033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1000111022033 its reverse (3302201110001), we get a palindrome (4302312132034).
The spelling of 1000111022033 in words is "one trillion, one hundred eleven million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •