Base | Representation |
---|---|
bin | 10011100100010110… |
… | …111111101001011101 |
3 | 2000020022002120212010 |
4 | 103210112333221131 |
5 | 321012320233201 |
6 | 13352524501433 |
7 | 1342450265010 |
oct | 234426775135 |
9 | 60208076763 |
10 | 21011102301 |
11 | 8a02246162 |
12 | 40a46aa879 |
13 | 1c9b001317 |
14 | 10346c3377 |
15 | 82e8e1bd6 |
hex | 4e45bfa5d |
21011102301 has 32 divisors (see below), whose sum is σ = 34561013760. Its totient is φ = 11088310464.
The previous prime is 21011102297. The next prime is 21011102317. The reversal of 21011102301 is 10320111012.
It is not a de Polignac number, because 21011102301 - 22 = 21011102297 is a prime.
It is a super-3 number, since 3×210111023013 (a number of 32 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011102501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 736015 + ... + 764028.
It is an arithmetic number, because the mean of its divisors is an integer number (1080031680).
Almost surely, 221011102301 is an apocalyptic number.
21011102301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21011102301 is a deficient number, since it is larger than the sum of its proper divisors (13549911459).
21011102301 is a wasteful number, since it uses less digits than its factorization.
21011102301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1500105.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 21011102301 its reverse (10320111012), we get a palindrome (31331213313).
It can be divided in two parts, 21011102 and 301, that added together give a triangular number (21011403 = T6482).
The spelling of 21011102301 in words is "twenty-one billion, eleven million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •