Base | Representation |
---|---|
bin | 10110111111100000010001… |
… | …111000110011110101110101 |
3 | 111021001002000001122002021212 |
4 | 112333200101320303311311 |
5 | 101223231312042401401 |
6 | 555022203432051205 |
7 | 30204515620023134 |
oct | 2677402170636565 |
9 | 437032001562255 |
10 | 101121010122101 |
11 | 2a2471a7aa3942 |
12 | b411b19833b05 |
13 | 445689396b318 |
14 | 1ad83d67c591b |
15 | ba55c9a1bdbb |
hex | 5bf811e33d75 |
101121010122101 has 16 divisors (see below), whose sum is σ = 106911718093440. Its totient is φ = 95377247205120.
The previous prime is 101121010122091. The next prime is 101121010122103. The reversal of 101121010122101 is 101221010121101.
It is a cyclic number.
It is not a de Polignac number, because 101121010122101 - 218 = 101121009859957 is a prime.
It is a super-2 number, since 2×1011210101221012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121010122103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39309056 + ... + 41802438.
It is an arithmetic number, because the mean of its divisors is an integer number (6681982380840).
Almost surely, 2101121010122101 is an apocalyptic number.
It is an amenable number.
101121010122101 is a deficient number, since it is larger than the sum of its proper divisors (5790707971339).
101121010122101 is a wasteful number, since it uses less digits than its factorization.
101121010122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2502796.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101121010122101 its reverse (101221010121101), we get a palindrome (202342020243202).
The spelling of 101121010122101 in words is "one hundred one trillion, one hundred twenty-one billion, ten million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •