Base | Representation |
---|---|
bin | 10011000001100001… |
… | …01001111111101100 |
3 | 222100210010111210210 |
4 | 21200300221333230 |
5 | 131404101133002 |
6 | 4405242302420 |
7 | 511044431256 |
oct | 114060517754 |
9 | 28323114723 |
10 | 10213302252 |
11 | 437116316a |
12 | 1b904b7a10 |
13 | c69c5141a |
14 | 6cc608cd6 |
15 | 3eb99396c |
hex | 260c29fec |
10213302252 has 48 divisors (see below), whose sum is σ = 24491577600. Its totient is φ = 3310195392.
The previous prime is 10213302247. The next prime is 10213302259. The reversal of 10213302252 is 25220331201.
10213302252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (10213302259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 733249 + ... + 747047.
It is an arithmetic number, because the mean of its divisors is an integer number (510241200).
Almost surely, 210213302252 is an apocalyptic number.
10213302252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10213302252 is an abundant number, since it is smaller than the sum of its proper divisors (14278275348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213302252 is a wasteful number, since it uses less digits than its factorization.
10213302252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15510 (or 15508 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 10213302252 its reverse (25220331201), we get a palindrome (35433633453).
The spelling of 10213302252 in words is "ten billion, two hundred thirteen million, three hundred two thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •