Base | Representation |
---|---|
bin | 10110111111001110101100… |
… | …000101000110111110111110 |
3 | 111020222021020201200021112022 |
4 | 112333032230011012332332 |
5 | 101222424121240413042 |
6 | 555005401310240142 |
7 | 30203246560240625 |
oct | 2677165405067676 |
9 | 436867221607468 |
10 | 101102122201022 |
11 | 2a23a19528a208 |
12 | b40a3281b6052 |
13 | 4454b737b3267 |
14 | 1ad75240a46bc |
15 | ba4d71720cd2 |
hex | 5bf3ac146fbe |
101102122201022 has 4 divisors (see below), whose sum is σ = 151653183301536. Its totient is φ = 50551061100510.
The previous prime is 101102122201007. The next prime is 101102122201027. The reversal of 101102122201022 is 220102221201101.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1011021222010222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102122201027) by changing a digit.
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 as a sum of consecutive naturals, namely, 25275530550254 + ... + 25275530550257.
It is an arithmetic number, because the mean of its divisors is an integer number (37913295825384).
Almost surely, 2101102122201022 is an apocalyptic number.
101102122201022 is a deficient number, since it is larger than the sum of its proper divisors (50551061100514).
101102122201022 is an equidigital number, since it uses as much as digits as its factorization.
101102122201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50551061100513.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101102122201022 its reverse (220102221201101), we get a palindrome (321204343402123).
The spelling of 101102122201022 in words is "one hundred one trillion, one hundred two billion, one hundred twenty-two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •