Base | Representation |
---|---|
bin | 101101011111111110111111… |
… | …010001000111001111011100 |
3 | 222020112022222001220111010221 |
4 | 231133332333101013033130 |
5 | 202212100320214103200 |
6 | 1545333140115011124 |
7 | 60102321044630602 |
oct | 5537767721071734 |
9 | 866468861814127 |
10 | 200110030222300 |
11 | 58841207225970 |
12 | 1a53a7b8299aa4 |
13 | 87873aab0acb3 |
14 | 375b53cc33872 |
15 | 18204c3b5691a |
hex | b5ffbf4473dc |
200110030222300 has 36 divisors (see below), whose sum is σ = 473715017001576. Its totient is φ = 72767283716800.
The previous prime is 200110030222253. The next prime is 200110030222301. The reversal of 200110030222300 is 3222030011002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200110030222301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 90959103547 + ... + 90959105746.
It is an arithmetic number, because the mean of its divisors is an integer number (13158750472266).
Almost surely, 2200110030222300 is an apocalyptic number.
200110030222300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200110030222300 is an abundant number, since it is smaller than the sum of its proper divisors (273604986779276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200110030222300 is a wasteful number, since it uses less digits than its factorization.
200110030222300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181918209318 (or 181918209311 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 200110030222300 its reverse (3222030011002), we get a palindrome (203332060233302).
The spelling of 200110030222300 in words is "two hundred trillion, one hundred ten billion, thirty million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •