Base | Representation |
---|---|
bin | 1011110001010111011… |
… | …1011011000001001000 |
3 | 201022222210000022210210 |
4 | 2330111313123001020 |
5 | 11303131430004112 |
6 | 232523041241120 |
7 | 20416312204236 |
oct | 2742567330110 |
9 | 638883008723 |
10 | 202230313032 |
11 | 78846815410 |
12 | 3323a6331a0 |
13 | 160bb405127 |
14 | 9b063ad956 |
15 | 53d917cb3c |
hex | 2f15ddb048 |
202230313032 has 64 divisors (see below), whose sum is σ = 566443656000. Its totient is φ = 59625642240.
The previous prime is 202230313009. The next prime is 202230313127. The reversal of 202230313032 is 230313032202.
202230313032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10341907 + ... + 10361442.
It is an arithmetic number, because the mean of its divisors is an integer number (8850682125).
Almost surely, 2202230313032 is an apocalyptic number.
202230313032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
202230313032 is an abundant number, since it is smaller than the sum of its proper divisors (364213342968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202230313032 is a wasteful number, since it uses less digits than its factorization.
202230313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20703406 (or 20703402 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 202230313032 its reverse (230313032202), we get a palindrome (432543345234).
The spelling of 202230313032 in words is "two hundred two billion, two hundred thirty million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •