Base | Representation |
---|---|
bin | 1001101001101001000100… |
… | …11011101110010001111011 |
3 | 2210010210201102221110122110 |
4 | 10310310202123232101323 |
5 | 10240200134320233311 |
6 | 113045131325023403 |
7 | 4320145135013634 |
oct | 464644233562173 |
9 | 83123642843573 |
10 | 21222011102331 |
11 | 6842228013096 |
12 | 2468b746b4b63 |
13 | bac2c4b09c40 |
14 | 535217bb688b |
15 | 26c0771448a6 |
hex | 134d226ee47b |
21222011102331 has 48 divisors (see below), whose sum is σ = 31588591507200. Its totient is φ = 12597773601600.
The previous prime is 21222011102293. The next prime is 21222011102351. The reversal of 21222011102331 is 13320111022212.
It is not a de Polignac number, because 21222011102331 - 218 = 21222010840187 is a prime.
It is a super-2 number, since 2×212220111023312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21222011102298 and 21222011102307.
It is not an unprimeable number, because it can be changed into a prime (21222011102351) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10745620 + ... + 12566318.
It is an arithmetic number, because the mean of its divisors is an integer number (658095656400).
Almost surely, 221222011102331 is an apocalyptic number.
21222011102331 is a deficient number, since it is larger than the sum of its proper divisors (10366580404869).
21222011102331 is a wasteful number, since it uses less digits than its factorization.
21222011102331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1821088 (or 1821057 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21222011102331 its reverse (13320111022212), we get a palindrome (34542122124543).
The spelling of 21222011102331 in words is "twenty-one trillion, two hundred twenty-two billion, eleven million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •