Base | Representation |
---|---|
bin | 10100111110111110… |
… | …010000001010011101 |
3 | 2011011020200211001101 |
4 | 110332332100022131 |
5 | 332121010434010 |
6 | 14203432513101 |
7 | 1425230153443 |
oct | 247676201235 |
9 | 64136624041 |
10 | 22531343005 |
11 | 96123a0536 |
12 | 444984b791 |
13 | 2180c5c432 |
14 | 113a574b93 |
15 | 8bd0d873a |
hex | 53ef9029d |
22531343005 has 4 divisors (see below), whose sum is σ = 27037611612. Its totient is φ = 18025074400.
The previous prime is 22531342979. The next prime is 22531343033. The reversal of 22531343005 is 50034313522.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11445148324 + 11086194681 = 106982^2 + 105291^2 .
It is not a de Polignac number, because 22531343005 - 27 = 22531342877 is a prime.
It is a super-2 number, since 2×225313430052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2253134296 + ... + 2253134305.
It is an arithmetic number, because the mean of its divisors is an integer number (6759402903).
Almost surely, 222531343005 is an apocalyptic number.
It is an amenable number.
22531343005 is a deficient number, since it is larger than the sum of its proper divisors (4506268607).
22531343005 is an equidigital number, since it uses as much as digits as its factorization.
22531343005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4506268606.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 22531343005 its reverse (50034313522), we get a palindrome (72565656527).
The spelling of 22531343005 in words is "twenty-two billion, five hundred thirty-one million, three hundred forty-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •