Base | Representation |
---|---|
bin | 10101000000010100… |
… | …110111111100000111 |
3 | 2011012211102110121201 |
4 | 111000110313330013 |
5 | 332142314102221 |
6 | 14210003323331 |
7 | 1425624156502 |
oct | 250024677407 |
9 | 64184373551 |
10 | 22554050311 |
11 | 962419a901 |
12 | 4455380547 |
13 | 218587cc00 |
14 | 113d5a6139 |
15 | 8c00c1891 |
hex | 540537f07 |
22554050311 has 12 divisors (see below), whose sum is σ = 24523815360. Its totient is φ = 20732699520.
The previous prime is 22554050291. The next prime is 22554050327. The reversal of 22554050311 is 11305045522.
It is not a de Polignac number, because 22554050311 - 211 = 22554048263 is a prime.
It is a super-2 number, since 2×225540503112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22554050311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22554050371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 236151 + ... + 317608.
It is an arithmetic number, because the mean of its divisors is an integer number (2043651280).
Almost surely, 222554050311 is an apocalyptic number.
22554050311 is a deficient number, since it is larger than the sum of its proper divisors (1969765049).
22554050311 is a wasteful number, since it uses less digits than its factorization.
22554050311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554026 (or 554013 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 22554050311 its reverse (11305045522), we get a palindrome (33859095833).
The spelling of 22554050311 in words is "twenty-two billion, five hundred fifty-four million, fifty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •