Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …111010101001111010110110 |
3 | 111020222020221100112110012011 |
4 | 112333032210322221322312 |
5 | 101222423400004120042 |
6 | 555005341334314434 |
7 | 30203243600563663 |
oct | 2677164472517266 |
9 | 436866840473164 |
10 | 101102002020022 |
11 | 2a23a133464473 |
12 | b40a2b3ab8a1a |
13 | 4454b54924b43 |
14 | 1ad751213ca6a |
15 | ba4d65dd1a17 |
hex | 5bf3a4ea9eb6 |
101102002020022 has 16 divisors (see below), whose sum is σ = 154514985397920. Its totient is φ = 49597014356032.
The previous prime is 101102002020017. The next prime is 101102002020037. The reversal of 101102002020022 is 220020200201101.
It is a happy number.
It is a super-4 number, since 4×1011020020200224 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 101102002019984 and 101102002020011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27503754 + ... + 30962242.
It is an arithmetic number, because the mean of its divisors is an integer number (9657186587370).
Almost surely, 2101102002020022 is an apocalyptic number.
101102002020022 is a deficient number, since it is larger than the sum of its proper divisors (53412983377898).
101102002020022 is a wasteful number, since it uses less digits than its factorization.
101102002020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3734327.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 101102002020022 its reverse (220020200201101), we get a palindrome (321122202221123).
The spelling of 101102002020022 in words is "one hundred one trillion, one hundred two billion, two million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •