Base | Representation |
---|---|
bin | 10110111111100001010010… |
… | …111110000010000011110101 |
3 | 111021001011211011012202001011 |
4 | 112333201102332002003311 |
5 | 101223241031103310401 |
6 | 555022504035032221 |
7 | 30204554645642104 |
oct | 2677412276020365 |
9 | 437034734182034 |
10 | 101122102010101 |
11 | 2a247708378517 |
12 | b41218343b671 |
13 | 4456a08c3b8b3 |
14 | 1ad849b81203b |
15 | ba56407ee451 |
hex | 5bf852f820f5 |
101122102010101 has 8 divisors (see below), whose sum is σ = 101805248527904. Its totient is φ = 100439720925840.
The previous prime is 101122102010089. The next prime is 101122102010123. The reversal of 101122102010101 is 101010201221101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101122102010101 - 29 = 101122102009589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101122102019101) 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, 191093271 + ... + 191621716.
It is an arithmetic number, because the mean of its divisors is an integer number (12725656065988).
Almost surely, 2101122102010101 is an apocalyptic number.
It is an amenable number.
101122102010101 is a deficient number, since it is larger than the sum of its proper divisors (683146517803).
101122102010101 is a wasteful number, since it uses less digits than its factorization.
101122102010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382716771.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101122102010101 its reverse (101010201221101), we get a palindrome (202132303231202).
The spelling of 101122102010101 in words is "one hundred one trillion, one hundred twenty-two billion, one hundred two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •