Base | Representation |
---|---|
bin | 10100111011000111… |
… | …01011110100000000 |
3 | 1001222212110101010121 |
4 | 22131203223310000 |
5 | 141001211441000 |
6 | 5054400510024 |
7 | 545241401521 |
oct | 123543536400 |
9 | 31885411117 |
10 | 11233312000 |
11 | 4844a03629 |
12 | 221601b314 |
13 | 10a03762a1 |
14 | 787c84848 |
15 | 45b2c8b1a |
hex | 29d8ebd00 |
11233312000 has 72 divisors (see below), whose sum is σ = 27983664072. Its totient is φ = 4493312000.
The previous prime is 11233311997. The next prime is 11233312001. The reversal of 11233312000 is 21333211.
It can be written as a sum of positive squares in 4 ways, for example, as 7485696 + 11225826304 = 2736^2 + 105952^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11233312001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143521 + ... + 207520.
It is an arithmetic number, because the mean of its divisors is an integer number (388662001).
Almost surely, 211233312000 is an apocalyptic number.
11233312000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11233312000 is an abundant number, since it is smaller than the sum of its proper divisors (16750352072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11233312000 is an frugal number, since it uses more digits than its factorization.
11233312000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 351072 (or 351048 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11233312000 its reverse (21333211), we get a palindrome (11254645211).
The spelling of 11233312000 in words is "eleven billion, two hundred thirty-three million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •