Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …111101100001000010000101 |
3 | 111020122200011200002121121212 |
4 | 112331322330331201002011 |
5 | 101214441002021010041 |
6 | 554500211423421205 |
7 | 30163614520464161 |
oct | 2675727475410205 |
9 | 436580150077555 |
10 | 101012211110021 |
11 | 2a205046874832 |
12 | b3b4a15154805 |
13 | 4449545220473 |
14 | 1ad3034d0bca1 |
15 | ba285d0a78eb |
hex | 5bdebcf61085 |
101012211110021 has 16 divisors (see below), whose sum is σ = 105755405232960. Its totient is φ = 96353040927360.
The previous prime is 101012211110017. The next prime is 101012211110023. The reversal of 101012211110021 is 120011112210101.
It is a cyclic number.
It is not a de Polignac number, because 101012211110021 - 22 = 101012211110017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101012211109978 and 101012211110005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012211110023) 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, 468489386 + ... + 468704948.
It is an arithmetic number, because the mean of its divisors is an integer number (6609712827060).
Almost surely, 2101012211110021 is an apocalyptic number.
It is an amenable number.
101012211110021 is a deficient number, since it is larger than the sum of its proper divisors (4743194122939).
101012211110021 is a wasteful number, since it uses less digits than its factorization.
101012211110021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410356.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101012211110021 its reverse (120011112210101), we get a palindrome (221023323320122).
The spelling of 101012211110021 in words is "one hundred one trillion, twelve billion, two hundred eleven million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •