Base | Representation |
---|---|
bin | 10110111111001110101100… |
… | …000101000110101111010110 |
3 | 111020222021020201200020011021 |
4 | 112333032230011012233112 |
5 | 101222424121240400042 |
6 | 555005401310231354 |
7 | 30203246560234666 |
oct | 2677165405065726 |
9 | 436867221606137 |
10 | 101102122200022 |
11 | 2a23a195289489 |
12 | b40a3281b555a |
13 | 4454b737b2978 |
14 | 1ad75240a41a6 |
15 | ba4d71720867 |
hex | 5bf3ac146bd6 |
101102122200022 has 4 divisors (see below), whose sum is σ = 151653183300036. Its totient is φ = 50551061100010.
The previous prime is 101102122200007. The next prime is 101102122200029. The reversal of 101102122200022 is 220002221201101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1011021222000222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101102122199969 and 101102122200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102122200029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275530550004 + ... + 25275530550007.
It is an arithmetic number, because the mean of its divisors is an integer number (37913295825009).
Almost surely, 2101102122200022 is an apocalyptic number.
101102122200022 is a deficient number, since it is larger than the sum of its proper divisors (50551061100014).
101102122200022 is an equidigital number, since it uses as much as digits as its factorization.
101102122200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50551061100013.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101102122200022 its reverse (220002221201101), we get a palindrome (321104343401123).
The spelling of 101102122200022 in words is "one hundred one trillion, one hundred two billion, one hundred twenty-two million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •