Base | Representation |
---|---|
bin | 10010101100000100… |
… | …00011000100010101 |
3 | 221220020110001121221 |
4 | 21112002003010111 |
5 | 131022011441041 |
6 | 4335332410341 |
7 | 503430513355 |
oct | 112602030425 |
9 | 27806401557 |
10 | 10033312021 |
11 | 42895a7907 |
12 | 1b401769b1 |
13 | c3b881b25 |
14 | 6b2754b65 |
15 | 3dac8d2d1 |
hex | 256083115 |
10033312021 has 2 divisors, whose sum is σ = 10033312022. Its totient is φ = 10033312020.
The previous prime is 10033311989. The next prime is 10033312061. The reversal of 10033312021 is 12021333001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6907272100 + 3126039921 = 83110^2 + 55911^2 .
It is an emirp because it is prime and its reverse (12021333001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10033312021 - 25 = 10033311989 is a prime.
It is a super-2 number, since 2×100333120212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10033311986 and 10033312004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10033312061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5016656010 + 5016656011.
It is an arithmetic number, because the mean of its divisors is an integer number (5016656011).
Almost surely, 210033312021 is an apocalyptic number.
It is an amenable number.
10033312021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10033312021 is an equidigital number, since it uses as much as digits as its factorization.
10033312021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10033312021 its reverse (12021333001), we get a palindrome (22054645022).
The spelling of 10033312021 in words is "ten billion, thirty-three million, three hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •