Base | Representation |
---|---|
bin | 10110111111011111010101… |
… | …110011100101110100111110 |
3 | 111021000222101210220022202120 |
4 | 112333133111303211310332 |
5 | 101223222231020333042 |
6 | 555021515423103410 |
7 | 30204451630116363 |
oct | 2677372563456476 |
9 | 437028353808676 |
10 | 101120002121022 |
11 | 2a2468300057a5 |
12 | b411898141b66 |
13 | 4456762b8c391 |
14 | 1ad833c99446a |
15 | ba556b2a9dec |
hex | 5bf7d5ce5d3e |
101120002121022 has 16 divisors (see below), whose sum is σ = 202263957914880. Its totient is φ = 33702675094872.
The previous prime is 101120002121009. The next prime is 101120002121023. The reversal of 101120002121022 is 220121200021101.
It is a super-3 number, since 3×1011200021210223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101120002120992 and 101120002121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101120002121023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 998014822 + ... + 998116137.
It is an arithmetic number, because the mean of its divisors is an integer number (12641497369680).
Almost surely, 2101120002121022 is an apocalyptic number.
101120002121022 is an abundant number, since it is smaller than the sum of its proper divisors (101143955793858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120002121022 is a wasteful number, since it uses less digits than its factorization.
101120002121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1996139407.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101120002121022 its reverse (220121200021101), we get a palindrome (321241202142123).
The spelling of 101120002121022 in words is "one hundred one trillion, one hundred twenty billion, two million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •