Base | Representation |
---|---|
bin | 101101100010111001011010… |
… | …111010011110101010010110 |
3 | 222021020110122221112100202022 |
4 | 231202321122322132222112 |
5 | 202223340302231431410 |
6 | 1550005123511013142 |
7 | 60122635511133146 |
oct | 5542713272365226 |
9 | 867213587470668 |
10 | 200310210030230 |
11 | 589090a0538463 |
12 | 1a57156406a1b2 |
13 | 87a02304647a1 |
14 | 37670ccb5c926 |
15 | 18257dcc97455 |
hex | b62e5ae9ea96 |
200310210030230 has 64 divisors (see below), whose sum is σ = 402413501468160. Its totient is φ = 71343637415424.
The previous prime is 200310210030197. The next prime is 200310210030233. The reversal of 200310210030230 is 32030012013002.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 200310210030199 and 200310210030208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200310210030233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40303472 + ... + 44999891.
It is an arithmetic number, because the mean of its divisors is an integer number (6287710960440).
Almost surely, 2200310210030230 is an apocalyptic number.
200310210030230 is an abundant number, since it is smaller than the sum of its proper divisors (202103291437930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200310210030230 is a wasteful number, since it uses less digits than its factorization.
200310210030230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85304133.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200310210030230 its reverse (32030012013002), we get a palindrome (232340222043232).
The spelling of 200310210030230 in words is "two hundred trillion, three hundred ten billion, two hundred ten million, thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •