Base | Representation |
---|---|
bin | 1001100011011110011000… |
… | …01101000100010000110101 |
3 | 2202101112202202120002000000 |
4 | 10301233030031010100311 |
5 | 10223212201410202013 |
6 | 112403524534541513 |
7 | 4265634065032362 |
oct | 461571415042065 |
9 | 82345682502000 |
10 | 21010111022133 |
11 | 6770379a37572 |
12 | 2433a97807899 |
13 | b9532526c3bc |
14 | 528c75487469 |
15 | 2667c40da973 |
hex | 131bcc344435 |
21010111022133 has 56 divisors (see below), whose sum is σ = 33002239124736. Its totient is φ = 13352597280000.
The previous prime is 21010111022099. The next prime is 21010111022167. The reversal of 21010111022133 is 33122011101012.
It is an interprime number because it is at equal distance from previous prime (21010111022099) and next prime (21010111022167).
It is not a de Polignac number, because 21010111022133 - 28 = 21010111021877 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010113022133) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 5423868 + ... + 8452133.
It is an arithmetic number, because the mean of its divisors is an integer number (589325698656).
Almost surely, 221010111022133 is an apocalyptic number.
It is an amenable number.
21010111022133 is a deficient number, since it is larger than the sum of its proper divisors (11992128102603).
21010111022133 is an equidigital number, since it uses as much as digits as its factorization.
21010111022133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13876117 (or 13876102 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 21010111022133 its reverse (33122011101012), we get a palindrome (54132122123145).
The spelling of 21010111022133 in words is "twenty-one trillion, ten billion, one hundred eleven million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •