Base | Representation |
---|---|
bin | 101101011110011000101000… |
… | …101101110011000111010110 |
3 | 222020010211021221121220102110 |
4 | 231132120220231303013112 |
5 | 202203300231312400042 |
6 | 1545210442540051450 |
7 | 60061350446100435 |
oct | 5536305055630726 |
9 | 866124257556373 |
10 | 200000130200022 |
11 | 587a9640561579 |
12 | 1a521446b33b86 |
13 | 8779c15247709 |
14 | 37560b503711c |
15 | 181c6e070c09c |
hex | b5e628b731d6 |
200000130200022 has 32 divisors (see below), whose sum is σ = 401467960514304. Its totient is φ = 66422121746400.
The previous prime is 200000130200021. The next prime is 200000130200041. The reversal of 200000130200022 is 220002031000002.
It is a super-3 number, since 3×2000001302000223 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200000130199980 and 200000130200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000130200021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24735247 + ... + 31809317.
It is an arithmetic number, because the mean of its divisors is an integer number (12545873766072).
Almost surely, 2200000130200022 is an apocalyptic number.
200000130200022 is an abundant number, since it is smaller than the sum of its proper divisors (201467830314282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200000130200022 is a wasteful number, since it uses less digits than its factorization.
200000130200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7091364.
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 200000130200022 its reverse (220002031000002), we get a palindrome (420002161200024).
The spelling of 200000130200022 in words is "two hundred trillion, one hundred thirty million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •