Base | Representation |
---|---|
bin | 10110110010001111111011… |
… | …100010001000010010001110 |
3 | 111010210222210022022112201111 |
4 | 112302033323202020102032 |
5 | 101113320242103323042 |
6 | 553043515122002234 |
7 | 30051640513600363 |
oct | 2662177342102216 |
9 | 433728708275644 |
10 | 100210102011022 |
11 | 29a25958127813 |
12 | b2a54804a637a |
13 | 43bba0631b523 |
14 | 1aa62a280c46a |
15 | b8ba64a52517 |
hex | 5b23fb88848e |
100210102011022 has 4 divisors (see below), whose sum is σ = 150315153016536. Its totient is φ = 50105051005510.
The previous prime is 100210102011011. The next prime is 100210102011059. The reversal of 100210102011022 is 220110201012001.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×1002101020110223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100210102010993 and 100210102011011.
It is a congruent number.
It is an unprimeable number.
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, 25052525502754 + ... + 25052525502757.
It is an arithmetic number, because the mean of its divisors is an integer number (37578788254134).
Almost surely, 2100210102011022 is an apocalyptic number.
100210102011022 is a deficient number, since it is larger than the sum of its proper divisors (50105051005514).
100210102011022 is an equidigital number, since it uses as much as digits as its factorization.
100210102011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50105051005513.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100210102011022 its reverse (220110201012001), we get a palindrome (320320303023023).
The spelling of 100210102011022 in words is "one hundred trillion, two hundred ten billion, one hundred two million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •