Base | Representation |
---|---|
bin | 11101101110001001111… |
… | …11000010110011010001 |
3 | 10121121221000202021002222 |
4 | 32313010333002303101 |
5 | 113212420300010113 |
6 | 2101045515350425 |
7 | 133531405466303 |
oct | 16670477026321 |
9 | 3547830667088 |
10 | 1021212110033 |
11 | 364103682145 |
12 | 145b01a52415 |
13 | 753b8b17a3b |
14 | 375d96d1973 |
15 | 1b86db10e08 |
hex | edc4fc2cd1 |
1021212110033 has 2 divisors, whose sum is σ = 1021212110034. Its totient is φ = 1021212110032.
The previous prime is 1021212110011. The next prime is 1021212110153. The reversal of 1021212110033 is 3300112121201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 898415831104 + 122796278929 = 947848^2 + 350423^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021212110033 - 28 = 1021212109777 is a prime.
It is a super-2 number, since 2×10212121100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1021212109993 and 1021212110020.
It is not a weakly prime, because it can be changed into another prime (1021212119033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510606055016 + 510606055017.
It is an arithmetic number, because the mean of its divisors is an integer number (510606055017).
Almost surely, 21021212110033 is an apocalyptic number.
It is an amenable number.
1021212110033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021212110033 is an equidigital number, since it uses as much as digits as its factorization.
1021212110033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1021212110033 its reverse (3300112121201), we get a palindrome (4321324231234).
The spelling of 1021212110033 in words is "one trillion, twenty-one billion, two hundred twelve million, one hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •