Base | Representation |
---|---|
bin | 10100110001110101… |
… | …110100110111001111 |
3 | 2010120220010202201201 |
4 | 110301311310313033 |
5 | 331143110431343 |
6 | 14125522450331 |
7 | 1416613425226 |
oct | 246165646717 |
9 | 63526122651 |
10 | 22311030223 |
11 | 9509aa4259 |
12 | 43a7b039a7 |
13 | 2147412541 |
14 | 11191c5cbd |
15 | 8a8aba94d |
hex | 531d74dcf |
22311030223 has 8 divisors (see below), whose sum is σ = 22619920400. Its totient is φ = 22002228288.
The previous prime is 22311030211. The next prime is 22311030227. The reversal of 22311030223 is 32203011322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22311030223 - 25 = 22311030191 is a prime.
It is a super-3 number, since 3×223110302233 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 22311030223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22311030227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 612208 + ... + 647626.
It is an arithmetic number, because the mean of its divisors is an integer number (2827490050).
Almost surely, 222311030223 is an apocalyptic number.
22311030223 is a deficient number, since it is larger than the sum of its proper divisors (308890177).
22311030223 is an equidigital number, since it uses as much as digits as its factorization.
22311030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44121.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 22311030223 its reverse (32203011322), we get a palindrome (54514041545).
The spelling of 22311030223 in words is "twenty-two billion, three hundred eleven million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •