Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …101001111110010101110111 |
3 | 111020122122221110121111100120 |
4 | 112331322313221332111313 |
5 | 101214440311224213421 |
6 | 554500154523543023 |
7 | 30163612360100034 |
oct | 2675726751762567 |
9 | 436578843544316 |
10 | 101012122101111 |
11 | 2a205000600051 |
12 | b3b49ab38aa73 |
13 | 444952c957680 |
14 | 1ad302717c38b |
15 | ba28553748c6 |
hex | 5bdeb7a7e577 |
101012122101111 has 8 divisors (see below), whose sum is σ = 145043047119600. Its totient is φ = 62161305908352.
The previous prime is 101012122101097. The next prime is 101012122101113. The reversal of 101012122101111 is 111101221210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101012122101111 - 29 = 101012122100599 is a prime.
It is a super-2 number, since 2×1010121221011112 (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 (101012122101113) 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, 1295027206386 + ... + 1295027206463.
It is an arithmetic number, because the mean of its divisors is an integer number (18130380889950).
Almost surely, 2101012122101111 is an apocalyptic number.
101012122101111 is a deficient number, since it is larger than the sum of its proper divisors (44030925018489).
101012122101111 is a wasteful number, since it uses less digits than its factorization.
101012122101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2590054412865.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101012122101111 its reverse (111101221210101), we get a palindrome (212113343311212).
The spelling of 101012122101111 in words is "one hundred one trillion, twelve billion, one hundred twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •