Base | Representation |
---|---|
bin | 1010010101010100001110… |
… | …11010011011000010010001 |
3 | 2222110021010110121100212201 |
4 | 11022222013122123002101 |
5 | 10434241441101041411 |
6 | 120154350223523201 |
7 | 4533441264252613 |
oct | 512520732330221 |
9 | 88407113540781 |
10 | 22722648846481 |
11 | 7270691994061 |
12 | 266b975159501 |
13 | c8a9763a5c3c |
14 | 587ad4012db3 |
15 | 2961054b53c1 |
hex | 14aa8769b091 |
22722648846481 has 4 divisors (see below), whose sum is σ = 22722705044032. Its totient is φ = 22722592648932.
The previous prime is 22722648846473. The next prime is 22722648846551. The reversal of 22722648846481 is 18464884622722.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22722648846481 - 23 = 22722648846473 is a prime.
It is a super-2 number, since 2×227226488464812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22722648846421) 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, 27487845 + ... + 28302418.
It is an arithmetic number, because the mean of its divisors is an integer number (5680676261008).
Almost surely, 222722648846481 is an apocalyptic number.
It is an amenable number.
22722648846481 is a deficient number, since it is larger than the sum of its proper divisors (56197551).
22722648846481 is an equidigital number, since it uses as much as digits as its factorization.
22722648846481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56197550.
The product of its digits is 132120576, while the sum is 64.
The spelling of 22722648846481 in words is "twenty-two trillion, seven hundred twenty-two billion, six hundred forty-eight million, eight hundred forty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •