Base | Representation |
---|---|
bin | 101101111100111110011100… |
… | …011001011100101101111000 |
3 | 222111120210101110211221111021 |
4 | 231330332130121130231320 |
5 | 202442221012331431300 |
6 | 1553500304113312224 |
7 | 60366260434606156 |
oct | 5574763431345570 |
9 | 874523343757437 |
10 | 202102310030200 |
11 | 5943a1212410a8 |
12 | 1a800946865674 |
13 | 88a0220aaa358 |
14 | 37c9b382543d6 |
15 | 1857228ea9d1a |
hex | b7cf9c65cb78 |
202102310030200 has 96 divisors (see below), whose sum is σ = 494623167091200. Its totient is φ = 76585464109440.
The previous prime is 202102310030197. The next prime is 202102310030287. The reversal of 202102310030200 is 2030013201202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 735189177 + ... + 735464023.
It is an arithmetic number, because the mean of its divisors is an integer number (5152324657200).
Almost surely, 2202102310030200 is an apocalyptic number.
202102310030200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202102310030200 is an abundant number, since it is smaller than the sum of its proper divisors (292520857061000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202102310030200 is a wasteful number, since it uses less digits than its factorization.
202102310030200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468389 (or 468380 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 202102310030200 its reverse (2030013201202), we get a palindrome (204132323231402).
The spelling of 202102310030200 in words is "two hundred two trillion, one hundred two billion, three hundred ten million, thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •