Base | Representation |
---|---|
bin | 1011110001010111101… |
… | …0111000011110100010 |
3 | 201022222211201102010000 |
4 | 2330111322320132202 |
5 | 11303132143021010 |
6 | 232523112520430 |
7 | 20416323002652 |
oct | 2742572703642 |
9 | 638884642100 |
10 | 202231220130 |
11 | 78847284985 |
12 | 3323a9b0116 |
13 | 160bb661c84 |
14 | 9b06568362 |
15 | 53d92ab7c0 |
hex | 2f15eb87a2 |
202231220130 has 80 divisors (see below), whose sum is σ = 547033798080. Its totient is φ = 53605365408.
The previous prime is 202231220129. The next prime is 202231220131. The reversal of 202231220130 is 31022132202.
202231220130 is a `hidden beast` number, since 202 + 2 + 312 + 20 + 130 = 666.
It is an interprime number because it is at equal distance from previous prime (202231220129) and next prime (202231220131).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (202231220131) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 612240 + ... + 882779.
It is an arithmetic number, because the mean of its divisors is an integer number (6837922476).
Almost surely, 2202231220130 is an apocalyptic number.
202231220130 is an abundant number, since it is smaller than the sum of its proper divisors (344802577950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202231220130 is a wasteful number, since it uses less digits than its factorization.
202231220130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495205 (or 1495196 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 202231220130 its reverse (31022132202), we get a palindrome (233253352332).
The spelling of 202231220130 in words is "two hundred two billion, two hundred thirty-one million, two hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •