Base | Representation |
---|---|
bin | 10110111101111001111010… |
… | …110110111110111000011110 |
3 | 111020122120022101022010021111 |
4 | 112331321322312332320132 |
5 | 101214431214114213042 |
6 | 554455505405452234 |
7 | 30163545163166611 |
oct | 2675717266767036 |
9 | 436576271263244 |
10 | 101011102101022 |
11 | 2a204627866973 |
12 | b3b476587107a |
13 | 44493c9537019 |
14 | 1ad2d6b906178 |
15 | ba27e5a42517 |
hex | 5bde7adbee1e |
101011102101022 has 8 divisors (see below), whose sum is σ = 152622614123856. Its totient is φ = 50136897393072.
The previous prime is 101011102101017. The next prime is 101011102101023. The reversal of 101011102101022 is 220101201110101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1010111021010222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101011102100993 and 101011102101011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101011102101023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 184326828378 + ... + 184326828925.
It is an arithmetic number, because the mean of its divisors is an integer number (19077826765482).
Almost surely, 2101011102101022 is an apocalyptic number.
101011102101022 is a deficient number, since it is larger than the sum of its proper divisors (51611512022834).
101011102101022 is a wasteful number, since it uses less digits than its factorization.
101011102101022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368653657442.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101011102101022 its reverse (220101201110101), we get a palindrome (321112303211123).
The spelling of 101011102101022 in words is "one hundred one trillion, eleven billion, one hundred two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •