Base | Representation |
---|---|
bin | 1001100011110100101101… |
… | …10111101000100110001111 |
3 | 2202102200201101000210220002 |
4 | 10301322112313220212033 |
5 | 10223411230341110411 |
6 | 112413230412114515 |
7 | 4266540156106241 |
oct | 461722667504617 |
9 | 82380641023802 |
10 | 21022101113231 |
11 | 6775472040469 |
12 | 2436283165a3b |
13 | b964b634496a |
14 | 529691a46091 |
15 | 266c76a5033b |
hex | 131e96de898f |
21022101113231 has 4 divisors (see below), whose sum is σ = 21063894555312. Its totient is φ = 20980307671152.
The previous prime is 21022101113219. The next prime is 21022101113309. The reversal of 21022101113231 is 13231110122012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21022101113231 is a prime.
It is a super-2 number, since 2×210221011132312 (a number of 27 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 (21022101113731) 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, 20896720286 + ... + 20896721291.
It is an arithmetic number, because the mean of its divisors is an integer number (5265973638828).
Almost surely, 221022101113231 is an apocalyptic number.
21022101113231 is a deficient number, since it is larger than the sum of its proper divisors (41793442081).
21022101113231 is an equidigital number, since it uses as much as digits as its factorization.
21022101113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41793442080.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21022101113231 its reverse (13231110122012), we get a palindrome (34253211235243).
The spelling of 21022101113231 in words is "twenty-one trillion, twenty-two billion, one hundred one million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •