Base | Representation |
---|---|
bin | 10110111111001100111010… |
… | …000111011110110001011001 |
3 | 111020222002022110221120210212 |
4 | 112333030322013132301121 |
5 | 101222411212304020441 |
6 | 555004443450020505 |
7 | 30203151312541400 |
oct | 2677147207366131 |
9 | 436862273846725 |
10 | 101100210220121 |
11 | 2a2393a3aa0702 |
12 | b409a93a17735 |
13 | 445492a646308 |
14 | 1ad73c219c637 |
15 | ba4cad947eeb |
hex | 5bf33a1dec59 |
101100210220121 has 96 divisors (see below), whose sum is σ = 121373920477440. Its totient is φ = 83942410696704.
The previous prime is 101100210220073. The next prime is 101100210220211. The reversal of 101100210220121 is 121022012001101.
It is not a de Polignac number, because 101100210220121 - 210 = 101100210219097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100210220096 and 101100210220105.
It is not an unprimeable number, because it can be changed into a prime (101100210220721) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 18292056260 + ... + 18292061786.
It is an arithmetic number, because the mean of its divisors is an integer number (1264311671640).
Almost surely, 2101100210220121 is an apocalyptic number.
It is an amenable number.
101100210220121 is a deficient number, since it is larger than the sum of its proper divisors (20273710257319).
101100210220121 is a wasteful number, since it uses less digits than its factorization.
101100210220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6143 (or 6136 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101100210220121 its reverse (121022012001101), we get a palindrome (222122222221222).
The spelling of 101100210220121 in words is "one hundred one trillion, one hundred billion, two hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •