Base | Representation |
---|---|
bin | 1001100110101111001100… |
… | …11111111101001100101011 |
3 | 2202210021010220212212020202 |
4 | 10303113212133331030223 |
5 | 10232031302130044433 |
6 | 112531225311542415 |
7 | 4310013222654464 |
oct | 463274637751453 |
9 | 82707126785222 |
10 | 21122221331243 |
11 | 680397a31709a |
12 | 245176522aa0b |
13 | ba2a80a26606 |
14 | 53046ca3bd6b |
15 | 2696865d4ee8 |
hex | 1335e67fd32b |
21122221331243 has 8 divisors (see below), whose sum is σ = 21832359923760. Its totient is φ = 20423820566880.
The previous prime is 21122221331161. The next prime is 21122221331287. The reversal of 21122221331243 is 34213312222112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21122221331243 - 216 = 21122221265707 is a prime.
It is a super-2 number, since 2×211222213312432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21122221331293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2934453380 + ... + 2934460577.
It is an arithmetic number, because the mean of its divisors is an integer number (2729044990470).
Almost surely, 221122221331243 is an apocalyptic number.
21122221331243 is a deficient number, since it is larger than the sum of its proper divisors (710138592517).
21122221331243 is an equidigital number, since it uses as much as digits as its factorization.
21122221331243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5868914077.
The product of its digits is 6912, while the sum is 29.
Adding to 21122221331243 its reverse (34213312222112), we get a palindrome (55335533553355).
The spelling of 21122221331243 in words is "twenty-one trillion, one hundred twenty-two billion, two hundred twenty-one million, three hundred thirty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •