Base | Representation |
---|---|
bin | 10011001110010111… |
… | …11000110101011100 |
3 | 222122021222102022021 |
4 | 21213023320311130 |
5 | 132114200313340 |
6 | 4424053025524 |
7 | 513523636600 |
oct | 114713706534 |
9 | 28567872267 |
10 | 10321104220 |
11 | 4416aa33a9 |
12 | 20006252a4 |
13 | c8639717b |
14 | 6dca6b500 |
15 | 406189e4a |
hex | 2672f8d5c |
10321104220 has 36 divisors (see below), whose sum is σ = 25212985560. Its totient is φ = 3538663968.
The previous prime is 10321104217. The next prime is 10321104221. The reversal of 10321104220 is 2240112301.
It is a junction number, because it is equal to n+sod(n) for n = 10321104194 and 10321104203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321104221) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 5264890 + ... + 5266849.
It is an arithmetic number, because the mean of its divisors is an integer number (700360710).
Almost surely, 210321104220 is an apocalyptic number.
10321104220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10321104220 is an abundant number, since it is smaller than the sum of its proper divisors (14891881340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321104220 is a wasteful number, since it uses less digits than its factorization.
10321104220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10531762 (or 10531753 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10321104220 its reverse (2240112301), we get a palindrome (12561216521).
The spelling of 10321104220 in words is "ten billion, three hundred twenty-one million, one hundred four thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •