Base | Representation |
---|---|
bin | 10011000001100000… |
… | …10001010011100000 |
3 | 222100202221101002011 |
4 | 21200300101103200 |
5 | 131404034413440 |
6 | 4405240202304 |
7 | 511043530363 |
oct | 114060212340 |
9 | 28322841064 |
10 | 10213201120 |
11 | 43710a4191 |
12 | 1b90469394 |
13 | c69c17395 |
14 | 6cc5c00da |
15 | 3eb9739ea |
hex | 260c114e0 |
10213201120 has 48 divisors (see below), whose sum is σ = 24163867728. Its totient is φ = 4079324160.
The previous prime is 10213201091. The next prime is 10213201123. The reversal of 10213201120 is 2110231201.
It is a self number, because there is not a number n which added to its sum of digits gives 10213201120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213201123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64372 + ... + 156748.
It is an arithmetic number, because the mean of its divisors is an integer number (503413911).
Almost surely, 210213201120 is an apocalyptic number.
10213201120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10213201120 is an abundant number, since it is smaller than the sum of its proper divisors (13950666608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213201120 is an equidigital number, since it uses as much as digits as its factorization.
10213201120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93083 (or 93075 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10213201120 its reverse (2110231201), we get a palindrome (12323432321).
The spelling of 10213201120 in words is "ten billion, two hundred thirteen million, two hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •