Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0111111110001000001 |
3 | 100200000020112000021021 |
4 | 1132023032333301001 |
5 | 3124043233241113 |
6 | 114242021025441 |
7 | 10206565422541 |
oct | 1361316776101 |
9 | 320006460237 |
10 | 101120212033 |
11 | 399807a5a75 |
12 | 17720b55281 |
13 | 96c69191b9 |
14 | 4c73b41321 |
15 | 296c76448d |
hex | 178b3bfc41 |
101120212033 has 2 divisors, whose sum is σ = 101120212034. Its totient is φ = 101120212032.
The previous prime is 101120212007. The next prime is 101120212049. The reversal of 101120212033 is 330212021101.
It is an a-pointer prime, because the next prime (101120212049) can be obtained adding 101120212033 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60021570049 + 41098641984 = 244993^2 + 202728^2 .
It is a cyclic number.
It is not a de Polignac number, because 101120212033 - 25 = 101120212001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101120211998 and 101120212016.
It is not a weakly prime, because it can be changed into another prime (101120212133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560106016 + 50560106017.
It is an arithmetic number, because the mean of its divisors is an integer number (50560106017).
Almost surely, 2101120212033 is an apocalyptic number.
It is an amenable number.
101120212033 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120212033 is an equidigital number, since it uses as much as digits as its factorization.
101120212033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101120212033 its reverse (330212021101), we get a palindrome (431332233134).
The spelling of 101120212033 in words is "one hundred one billion, one hundred twenty million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •