Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …111000001001111011101001 |
3 | 111020200102022021011200020110 |
4 | 112332002031320021323221 |
5 | 101220102440321010441 |
6 | 554503541420444533 |
7 | 30164312022420225 |
oct | 2676021570117351 |
9 | 436612267150213 |
10 | 101020011110121 |
11 | 2a20838975a304 |
12 | b3b64313a9749 |
13 | 444a1b91a933c |
14 | 1ad3574bd3785 |
15 | ba2b67c48b16 |
hex | 5be08de09ee9 |
101020011110121 has 8 divisors (see below), whose sum is σ = 142616486273184. Its totient is φ = 63385105010240.
The previous prime is 101020011110113. The next prime is 101020011110149. The reversal of 101020011110121 is 121011110020101.
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 101020011110121 - 23 = 101020011110113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101020011110097 and 101020011110106.
It is not an unprimeable number, because it can be changed into a prime (101020011110191) 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, 990392265735 + ... + 990392265836.
It is an arithmetic number, because the mean of its divisors is an integer number (17827060784148).
Almost surely, 2101020011110121 is an apocalyptic number.
It is an amenable number.
101020011110121 is a deficient number, since it is larger than the sum of its proper divisors (41596475163063).
101020011110121 is a wasteful number, since it uses less digits than its factorization.
101020011110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1980784531591.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101020011110121 its reverse (121011110020101), we get a palindrome (222031121130222).
The spelling of 101020011110121 in words is "one hundred one trillion, twenty billion, eleven million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •