Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …00101111000011110001 |
3 | 10112121110110022022121202 |
4 | 32203123100233003301 |
5 | 112341211404310113 |
6 | 2043240013500545 |
7 | 132153453215312 |
oct | 16433320570361 |
9 | 3477413268552 |
10 | 1000111010033 |
11 | 356165657423 |
12 | 1419b31a1755 |
13 | 73405295855 |
14 | 365970a2609 |
15 | 1b036393258 |
hex | e8db42f0f1 |
1000111010033 has 2 divisors, whose sum is σ = 1000111010034. Its totient is φ = 1000111010032.
The previous prime is 1000111009991. The next prime is 1000111010051. The reversal of 1000111010033 is 3300101110001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 691571865664 + 308539144369 = 831608^2 + 555463^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000111010033 - 26 = 1000111009969 is a prime.
It is a super-2 number, since 2×10001110100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000111009996 and 1000111010023.
It is not a weakly prime, because it can be changed into another prime (1000111010933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500055505016 + 500055505017.
It is an arithmetic number, because the mean of its divisors is an integer number (500055505017).
Almost surely, 21000111010033 is an apocalyptic number.
It is an amenable number.
1000111010033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111010033 is an equidigital number, since it uses as much as digits as its factorization.
1000111010033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 1000111010033 its reverse (3300101110001), we get a palindrome (4300212120034).
The spelling of 1000111010033 in words is "one trillion, one hundred eleven million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •