Base | Representation |
---|---|
bin | 10100110010100011… |
… | …111010110011111011 |
3 | 2010121201212122110210 |
4 | 110302203322303323 |
5 | 331204204110321 |
6 | 14131033442203 |
7 | 1420121221500 |
oct | 246243726373 |
9 | 63551778423 |
10 | 22323113211 |
11 | 95158a73a3 |
12 | 43abb70363 |
13 | 2149a83239 |
14 | 111aa4d4a7 |
15 | 8a9ba5b76 |
hex | 5328facfb |
22323113211 has 24 divisors (see below), whose sum is σ = 34641230160. Its totient is φ = 12749571072.
The previous prime is 22323113191. The next prime is 22323113227. The reversal of 22323113211 is 11231132322.
It is not a de Polignac number, because 22323113211 - 213 = 22323105019 is a prime.
It is a super-3 number, since 3×223231132113 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (22323115211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 258855 + ... + 334143.
It is an arithmetic number, because the mean of its divisors is an integer number (1443384590).
Almost surely, 222323113211 is an apocalyptic number.
22323113211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22323113211 is a deficient number, since it is larger than the sum of its proper divisors (12318116949).
22323113211 is a wasteful number, since it uses less digits than its factorization.
22323113211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77323 (or 77316 counting only the distinct ones).
The product of its digits is 432, while the sum is 21.
Adding to 22323113211 its reverse (11231132322), we get a palindrome (33554245533).
The spelling of 22323113211 in words is "twenty-two billion, three hundred twenty-three million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •