Base | Representation |
---|---|
bin | 11110001111101111100001… |
… | …001100001101101111010110 |
3 | 122102222220011020100220000210 |
4 | 132033233201030031233112 |
5 | 114413423013302400042 |
6 | 1150530004044350250 |
7 | 40006416104334312 |
oct | 3617574114155726 |
9 | 572886136326023 |
10 | 133023210200022 |
11 | 3942691028279a |
12 | 12b04957b45386 |
13 | 592c05b89014c |
14 | 24bc50185cb42 |
15 | 105a38b7bda9c |
hex | 78fbe130dbd6 |
133023210200022 has 8 divisors (see below), whose sum is σ = 266046420400056. Its totient is φ = 44341070066672.
The previous prime is 133023210200011. The next prime is 133023210200039. The reversal of 133023210200022 is 220002012320331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
133023210200022 is an admirable number.
It is a super-2 number, since 2×1330232102000222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11085267516663 + ... + 11085267516674.
It is an arithmetic number, because the mean of its divisors is an integer number (33255802550007).
Almost surely, 2133023210200022 is an apocalyptic number.
133023210200022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133023210200022 is a wasteful number, since it uses less digits than its factorization.
133023210200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22170535033342.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 133023210200022 its reverse (220002012320331), we get a palindrome (353025222520353).
The spelling of 133023210200022 in words is "one hundred thirty-three trillion, twenty-three billion, two hundred ten million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •