Base | Representation |
---|---|
bin | 10011000010110011… |
… | …11011110110111000 |
3 | 222101112111021112002 |
4 | 21201121323312320 |
5 | 131414333421240 |
6 | 4410310240132 |
7 | 511235420465 |
oct | 114131736670 |
9 | 28345437462 |
10 | 10224123320 |
11 | 43772841a4 |
12 | 1b94056048 |
13 | c6c26c918 |
14 | 6cdc2466c |
15 | 3ec8ced15 |
hex | 26167bdb8 |
10224123320 has 32 divisors (see below), whose sum is σ = 23032101600. Its totient is φ = 4084702848.
The previous prime is 10224123313. The next prime is 10224123341. The reversal of 10224123320 is 2332142201.
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 = 10224123292 and 10224123301.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 121004 + ... + 187323.
It is an arithmetic number, because the mean of its divisors is an integer number (719753175).
Almost surely, 210224123320 is an apocalyptic number.
10224123320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10224123320 is an abundant number, since it is smaller than the sum of its proper divisors (12807978280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10224123320 is a wasteful number, since it uses less digits than its factorization.
10224123320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309167 (or 309163 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10224123320 its reverse (2332142201), we get a palindrome (12556265521).
The spelling of 10224123320 in words is "ten billion, two hundred twenty-four million, one hundred twenty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •