Base | Representation |
---|---|
bin | 10110111111001110100110… |
… | …000111101000111010111110 |
3 | 111020222020222202111202022121 |
4 | 112333032212013220322332 |
5 | 101222423420140413042 |
6 | 555005343335033154 |
7 | 30203244234245503 |
oct | 2677164607507276 |
9 | 436866882452277 |
10 | 101102022201022 |
11 | 2a23a143898787 |
12 | b40a2ba80b7ba |
13 | 4454b58b6c76b |
14 | 1ad7514ab34aa |
15 | ba4d67a6b367 |
hex | 5bf3a61e8ebe |
101102022201022 has 8 divisors (see below), whose sum is σ = 151680591565056. Its totient is φ = 50541825012672.
The previous prime is 101102022201007. The next prime is 101102022201029. The reversal of 101102022201022 is 220102220201101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101102022200987 and 101102022201005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102022201029) 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 in 3 ways as a sum of consecutive naturals, for example, 4593030163 + ... + 4593052174.
It is an arithmetic number, because the mean of its divisors is an integer number (18960073945632).
Almost surely, 2101102022201022 is an apocalyptic number.
101102022201022 is a deficient number, since it is larger than the sum of its proper divisors (50578569364034).
101102022201022 is an equidigital number, since it uses as much as digits as its factorization.
101102022201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9186087842.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101102022201022 its reverse (220102220201101), we get a palindrome (321204242402123).
The spelling of 101102022201022 in words is "one hundred one trillion, one hundred two billion, twenty-two million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •