Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110011100101101100000 |
3 | 222020212222120220102120210122 |
4 | 231201131001212130231200 |
5 | 202220224112240214102 |
6 | 1545451355243215412 |
7 | 60112524151141646 |
oct | 5541350146345540 |
9 | 866788526376718 |
10 | 200211001101152 |
11 | 588800106a4688 |
12 | 1a556297217568 |
13 | 8793a7c7cc962 |
14 | 376239abc1196 |
15 | 1822e3321e0a2 |
hex | b6174199cb60 |
200211001101152 has 48 divisors (see below), whose sum is σ = 395085589113600. Its totient is φ = 99871875517440.
The previous prime is 200211001101151. The next prime is 200211001101179. The reversal of 200211001101152 is 251101100112002.
It is a super-3 number, since 3×2002110011011523 (a number of 44 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200211001101152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001101151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88561124 + ... + 90793692.
It is an arithmetic number, because the mean of its divisors is an integer number (8230949773200).
Almost surely, 2200211001101152 is an apocalyptic number.
It is an amenable number.
200211001101152 is a deficient number, since it is larger than the sum of its proper divisors (194874588012448).
200211001101152 is a wasteful number, since it uses less digits than its factorization.
200211001101152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2239119 (or 2239111 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 200211001101152 its reverse (251101100112002), we get a palindrome (451312101213154).
The spelling of 200211001101152 in words is "two hundred trillion, two hundred eleven billion, one million, one hundred one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •