Base | Representation |
---|---|
bin | 10110111111010111111010… |
… | …000010001110010011110001 |
3 | 111021000012210112010122222221 |
4 | 112333113322002032103301 |
5 | 101223104404110031113 |
6 | 555014115402401041 |
7 | 30204050054201425 |
oct | 2677277202162361 |
9 | 437005715118887 |
10 | 101112020002033 |
11 | 2a243404340647 |
12 | b41022ab00181 |
13 | 4455a9026a051 |
14 | 1ad7bc2822b85 |
15 | ba525064298d |
hex | 5bf5fa08e4f1 |
101112020002033 has 2 divisors, whose sum is σ = 101112020002034. Its totient is φ = 101112020002032.
The previous prime is 101112020001977. The next prime is 101112020002051. The reversal of 101112020002033 is 330200020211101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61981090059249 + 39130929942784 = 7872807^2 + 6255472^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101112020002033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101112020001998 and 101112020002016.
It is not a weakly prime, because it can be changed into another prime (101112020072033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556010001016 + 50556010001017.
It is an arithmetic number, because the mean of its divisors is an integer number (50556010001017).
Almost surely, 2101112020002033 is an apocalyptic number.
It is an amenable number.
101112020002033 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112020002033 is an equidigital number, since it uses as much as digits as its factorization.
101112020002033 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 101112020002033 its reverse (330200020211101), we get a palindrome (431312040213134).
The spelling of 101112020002033 in words is "one hundred one trillion, one hundred twelve billion, twenty million, two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •