Base | Representation |
---|---|
bin | 110010101101011001011100… |
… | …010001111111100111110011 |
3 | 1002020122200211000221102021110 |
4 | 302231121130101333213303 |
5 | 213212443044112024021 |
6 | 2110154522424524403 |
7 | 64655544363646503 |
oct | 6255313421774763 |
9 | 1066580730842243 |
10 | 223022020033011 |
11 | 65075120155851 |
12 | 2101b1b3320703 |
13 | 9759b6a119c34 |
14 | 3d10475451a03 |
15 | 1abb4ab903476 |
hex | cad65c47f9f3 |
223022020033011 has 32 divisors (see below), whose sum is σ = 331427439072000. Its totient is φ = 132569754071040.
The previous prime is 223022020033009. The next prime is 223022020033037. The reversal of 223022020033011 is 110330020220322.
It is a happy number.
It is not a de Polignac number, because 223022020033011 - 21 = 223022020033009 is a prime.
It is a super-2 number, since 2×2230220200330112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (223022020033051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 294664140 + ... + 295420038.
It is an arithmetic number, because the mean of its divisors is an integer number (10357107471000).
Almost surely, 2223022020033011 is an apocalyptic number.
223022020033011 is a deficient number, since it is larger than the sum of its proper divisors (108405419038989).
223022020033011 is a wasteful number, since it uses less digits than its factorization.
223022020033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060419.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 223022020033011 its reverse (110330020220322), we get a palindrome (333352040253333).
The spelling of 223022020033011 in words is "two hundred twenty-three trillion, twenty-two billion, twenty million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •