Base | Representation |
---|---|
bin | 10100011111010110… |
… | …10100101000111010 |
3 | 1001101122020220111020 |
4 | 22033223110220322 |
5 | 140012102330320 |
6 | 5015321243310 |
7 | 536413065564 |
oct | 121753245072 |
9 | 31348226436 |
10 | 11000433210 |
11 | 4735504318 |
12 | 2170033536 |
13 | 10640498a0 |
14 | 764d84334 |
15 | 445b27940 |
hex | 28fad4a3a |
11000433210 has 128 divisors (see below), whose sum is σ = 28910407680. Its totient is φ = 2662523136.
The previous prime is 11000433167. The next prime is 11000433277. The reversal of 11000433210 is 1233400011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11000433210.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9458089 + ... + 9459251.
It is an arithmetic number, because the mean of its divisors is an integer number (225862560).
Almost surely, 211000433210 is an apocalyptic number.
11000433210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11000433210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14455203840).
11000433210 is an abundant number, since it is smaller than the sum of its proper divisors (17909974470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000433210 is a wasteful number, since it uses less digits than its factorization.
11000433210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1572.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11000433210 its reverse (1233400011), we get a palindrome (12233833221).
The spelling of 11000433210 in words is "eleven billion, four hundred thirty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •