Base | Representation |
---|---|
bin | 1001000111000010101111… |
… | …10010000111010001011010 |
3 | 2121221011012011112121010120 |
4 | 10203201113302013101122 |
5 | 10111210443224121242 |
6 | 110335043010054110 |
7 | 4135231243200606 |
oct | 443412762072132 |
9 | 77834164477116 |
10 | 20033200223322 |
11 | 642403a297230 |
12 | 22b669a27a336 |
13 | b241796951b0 |
14 | 4d387d70c506 |
15 | 24b1999041ec |
hex | 123857c8745a |
20033200223322 has 64 divisors (see below), whose sum is σ = 47959148393856. Its totient is φ = 5497962312960.
The previous prime is 20033200223291. The next prime is 20033200223347. The reversal of 20033200223322 is 22332200233002.
It is a super-2 number, since 2×200332002233222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20033200223292 and 20033200223301.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 220225453 + ... + 220316400.
It is an arithmetic number, because the mean of its divisors is an integer number (749361693654).
Almost surely, 220033200223322 is an apocalyptic number.
20033200223322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20033200223322 is an abundant number, since it is smaller than the sum of its proper divisors (27925948170534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20033200223322 is a wasteful number, since it uses less digits than its factorization.
20033200223322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440541935.
The product of its (nonzero) digits is 5184, while the sum is 24.
Adding to 20033200223322 its reverse (22332200233002), we get a palindrome (42365400456324).
The spelling of 20033200223322 in words is "twenty trillion, thirty-three billion, two hundred million, two hundred twenty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •