Base | Representation |
---|---|
bin | 10011000001100010… |
… | …01001111100100000 |
3 | 222100210101011022202 |
4 | 21200301021330200 |
5 | 131404114324440 |
6 | 4405245152332 |
7 | 511045514642 |
oct | 114061117440 |
9 | 28323334282 |
10 | 10213433120 |
11 | 4371242520 |
12 | 1b9055b6a8 |
13 | c69c98b67 |
14 | 6cc640892 |
15 | 3eb9bc615 |
hex | 260c49f20 |
10213433120 has 48 divisors (see below), whose sum is σ = 26322807168. Its totient is φ = 3713975040.
The previous prime is 10213433117. The next prime is 10213433161. The reversal of 10213433120 is 2133431201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10213433092 and 10213433101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2899784 + ... + 2903303.
It is an arithmetic number, because the mean of its divisors is an integer number (548391816).
Almost surely, 210213433120 is an apocalyptic number.
10213433120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10213433120 is an abundant number, since it is smaller than the sum of its proper divisors (16109374048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213433120 is a wasteful number, since it uses less digits than its factorization.
10213433120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5803113 (or 5803105 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10213433120 its reverse (2133431201), we get a palindrome (12346864321).
The spelling of 10213433120 in words is "ten billion, two hundred thirteen million, four hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •