Base | Representation |
---|---|
bin | 10011101001101110… |
… | …101111001010001101 |
3 | 2000110120122122112112 |
4 | 103221232233022031 |
5 | 321203402243201 |
6 | 13405504113405 |
7 | 1344623226251 |
oct | 235156571215 |
9 | 60416578475 |
10 | 21101212301 |
11 | 8a490a2134 |
12 | 410a905865 |
13 | 1cb3891350 |
14 | 104265c261 |
15 | 8377910bb |
hex | 4e9baf28d |
21101212301 has 4 divisors (see below), whose sum is σ = 22724382492. Its totient is φ = 19478042112.
The previous prime is 21101212273. The next prime is 21101212309. The reversal of 21101212301 is 10321210112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9791102500 + 11310109801 = 98950^2 + 106349^2 .
It is a cyclic number.
It is not a de Polignac number, because 21101212301 - 210 = 21101211277 is a prime.
It is a super-2 number, since 2×211012123012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101212309) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 811585076 + ... + 811585101.
It is an arithmetic number, because the mean of its divisors is an integer number (5681095623).
Almost surely, 221101212301 is an apocalyptic number.
It is an amenable number.
21101212301 is a deficient number, since it is larger than the sum of its proper divisors (1623170191).
21101212301 is a wasteful number, since it uses less digits than its factorization.
21101212301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1623170190.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 21101212301 its reverse (10321210112), we get a palindrome (31422422413).
The spelling of 21101212301 in words is "twenty-one billion, one hundred one million, two hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •