Base | Representation |
---|---|
bin | 1001100011001111101101… |
… | …00001100011011101111111 |
3 | 2202100210102121002121202200 |
4 | 10301213312201203131333 |
5 | 10223100032130220221 |
6 | 112400143004522543 |
7 | 4265234602563315 |
oct | 461476641433577 |
9 | 82323377077680 |
10 | 21002231101311 |
11 | 6767aa5a25409 |
12 | 2432458850453 |
13 | b9466a880265 |
14 | 528728b1a0b5 |
15 | 2664b240e426 |
hex | 1319f686377f |
21002231101311 has 36 divisors (see below), whose sum is σ = 31250970694944. Its totient is φ = 13591457337600.
The previous prime is 21002231101277. The next prime is 21002231101333. The reversal of 21002231101311 is 11310113220012.
21002231101311 is a `hidden beast` number, since 21 + 0 + 0 + 2 + 231 + 101 + 311 = 666.
It is not a de Polignac number, because 21002231101311 - 210 = 21002231100287 is a prime.
It is a super-2 number, since 2×210022311013112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21002231101711) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3332871 + ... + 7287831.
It is an arithmetic number, because the mean of its divisors is an integer number (868082519304).
Almost surely, 221002231101311 is an apocalyptic number.
21002231101311 is a deficient number, since it is larger than the sum of its proper divisors (10248739593633).
21002231101311 is a wasteful number, since it uses less digits than its factorization.
21002231101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3955472 (or 3955432 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 21002231101311 its reverse (11310113220012), we get a palindrome (32312344321323).
The spelling of 21002231101311 in words is "twenty-one trillion, two billion, two hundred thirty-one million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •