Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …110000100111110100100110 |
3 | 111021000000120220010202000020 |
4 | 112333112001300213310212 |
5 | 101223041241020401042 |
6 | 555013143240300010 |
7 | 30203646052410345 |
oct | 2677260160476446 |
9 | 437000526122006 |
10 | 101110002122022 |
11 | 2a2425692a1513 |
12 | b40b967171606 |
13 | 445582b1a24ca |
14 | 1ad7a70831b5c |
15 | ba51833ec3ec |
hex | 5bf581c27d26 |
101110002122022 has 16 divisors (see below), whose sum is σ = 202392694270272. Its totient is φ = 33674552369640.
The previous prime is 101110002121993. The next prime is 101110002122023. The reversal of 101110002122022 is 220221200011101.
It is a junction number, because it is equal to n+sod(n) for n = 101110002121992 and 101110002122010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110002122023) 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, 7195410148 + ... + 7195424199.
It is an arithmetic number, because the mean of its divisors is an integer number (12649543391892).
Almost surely, 2101110002122022 is an apocalyptic number.
101110002122022 is an abundant number, since it is smaller than the sum of its proper divisors (101282692148250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110002122022 is a wasteful number, since it uses less digits than its factorization.
101110002122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14390835523.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101110002122022 its reverse (220221200011101), we get a palindrome (321331202133123).
The spelling of 101110002122022 in words is "one hundred one trillion, one hundred ten billion, two million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •