Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …010111101001111011010010 |
3 | 111021000010011120222110210210 |
4 | 112333112331113221323102 |
5 | 101223100313031210002 |
6 | 555013430403504550 |
7 | 30204012615125631 |
oct | 2677267527517322 |
9 | 437003146873723 |
10 | 101111002210002 |
11 | 2a242a31875404 |
12 | b40bba6088156 |
13 | 445595a440745 |
14 | 1ad7b275a3518 |
15 | ba51e10e996c |
hex | 5bf5bd5e9ed2 |
101111002210002 has 32 divisors (see below), whose sum is σ = 207184348405440. Its totient is φ = 32876848961280.
The previous prime is 101111002209953. The next prime is 101111002210063. The reversal of 101111002210002 is 200012200111101.
It is a super-2 number, since 2×1011110022100022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101111002210002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28164427 + ... + 31550862.
It is an arithmetic number, because the mean of its divisors is an integer number (6474510887670).
Almost surely, 2101111002210002 is an apocalyptic number.
101111002210002 is an abundant number, since it is smaller than the sum of its proper divisors (106073346195438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111002210002 is a wasteful number, since it uses less digits than its factorization.
101111002210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59722218.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101111002210002 its reverse (200012200111101), we get a palindrome (301123202321103).
The spelling of 101111002210002 in words is "one hundred one trillion, one hundred eleven billion, two million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •