Base | Representation |
---|---|
bin | 10110110010001000011000… |
… | …101111000101001110110101 |
3 | 111010210012212210201220122221 |
4 | 112302020120233011032311 |
5 | 101113202200003323221 |
6 | 553040055250522341 |
7 | 30051233006665216 |
oct | 2662103057051665 |
9 | 433705783656587 |
10 | 100202002011061 |
11 | 29a22480968975 |
12 | b2a399b8963b1 |
13 | 43bb015164942 |
14 | 1aa5b34b5340d |
15 | b8b73d8a2541 |
hex | 5b2218bc53b5 |
100202002011061 has 2 divisors, whose sum is σ = 100202002011062. Its totient is φ = 100202002011060.
The previous prime is 100202002010993. The next prime is 100202002011073. The reversal of 100202002011061 is 160110200202001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88875983888836 + 11326018122225 = 9427406^2 + 3365415^2 .
It is a cyclic number.
It is not a de Polignac number, because 100202002011061 - 27 = 100202002010933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100202002015061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50101001005530 + 50101001005531.
It is an arithmetic number, because the mean of its divisors is an integer number (50101001005531).
Almost surely, 2100202002011061 is an apocalyptic number.
It is an amenable number.
100202002011061 is a deficient number, since it is larger than the sum of its proper divisors (1).
100202002011061 is an equidigital number, since it uses as much as digits as its factorization.
100202002011061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 100202002011061 its reverse (160110200202001), we get a palindrome (260312202213062).
The spelling of 100202002011061 in words is "one hundred trillion, two hundred two billion, two million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •