Base | Representation |
---|---|
bin | 1001100011110100111101… |
… | …00111001100011100010011 |
3 | 2202102201001102110211022012 |
4 | 10301322132213030130103 |
5 | 10223412012120140311 |
6 | 112413251332333135 |
7 | 4266543324235121 |
oct | 461723647143423 |
9 | 82381042424265 |
10 | 21022231021331 |
11 | 67755293aa331 |
12 | 24362ba7741ab |
13 | b9650722a667 |
14 | 5296a4dc0911 |
15 | 266c8316178b |
hex | 131e9e9cc713 |
21022231021331 has 16 divisors (see below), whose sum is σ = 22546523197440. Its totient is φ = 19539735976800.
The previous prime is 21022231021321. The next prime is 21022231021357. The reversal of 21022231021331 is 13312013222012.
It is a cyclic number.
It is not a de Polignac number, because 21022231021331 - 234 = 21005051152147 is a prime.
It is a super-2 number, since 2×210222310213312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21022231021297 and 21022231021306.
It is not an unprimeable number, because it can be changed into a prime (21022231021321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97723616 + ... + 97938498.
It is an arithmetic number, because the mean of its divisors is an integer number (1409157699840).
Almost surely, 221022231021331 is an apocalyptic number.
21022231021331 is a deficient number, since it is larger than the sum of its proper divisors (1524292176109).
21022231021331 is a wasteful number, since it uses less digits than its factorization.
21022231021331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 312106.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 21022231021331 its reverse (13312013222012), we get a palindrome (34334244243343).
The spelling of 21022231021331 in words is "twenty-one trillion, twenty-two billion, two hundred thirty-one million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •