Base | Representation |
---|---|
bin | 101101011110101101011010… |
… | …001000001010111010010101 |
3 | 222020012221212100020000210200 |
4 | 231132231122020022322111 |
5 | 202204131421103031201 |
6 | 1545225012044411113 |
7 | 60063100244412435 |
oct | 5536553210127225 |
9 | 866187770200720 |
10 | 200022434033301 |
11 | 5880804648a640 |
12 | 1a525830546a99 |
13 | 877c05b00a1b9 |
14 | 37571cd2a82c5 |
15 | 181d098855386 |
hex | b5eb5a20ae95 |
200022434033301 has 24 divisors (see below), whose sum is σ = 316575354180384. Its totient is φ = 120691683584160.
The previous prime is 200022434033291. The next prime is 200022434033339. The reversal of 200022434033301 is 103330434220002.
200022434033301 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 224 + 3 + 403 + 3 + 30 + 1 = 666.
It is not a de Polignac number, because 200022434033301 - 27 = 200022434033173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022434033101) 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, 4450260846 + ... + 4450305791.
It is an arithmetic number, because the mean of its divisors is an integer number (13190639757516).
Almost surely, 2200022434033301 is an apocalyptic number.
It is an amenable number.
200022434033301 is a deficient number, since it is larger than the sum of its proper divisors (116552920147083).
200022434033301 is a wasteful number, since it uses less digits than its factorization.
200022434033301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8900566881 (or 8900566878 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 200022434033301 its reverse (103330434220002), we get a palindrome (303352868253303).
The spelling of 200022434033301 in words is "two hundred trillion, twenty-two billion, four hundred thirty-four million, thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •