Base | Representation |
---|---|
bin | 10101000111110011… |
… | …01001100000001000 |
3 | 1002021021201010022010 |
4 | 22203321221200020 |
5 | 141210432424000 |
6 | 5113121455520 |
7 | 551003066031 |
oct | 124371514010 |
9 | 32237633263 |
10 | 11339733000 |
11 | 4899a90272 |
12 | 22457a15a0 |
13 | 10b94275ab |
14 | 798067a88 |
15 | 4657ead50 |
hex | 2a3e69808 |
11339733000 has 128 divisors (see below), whose sum is σ = 35481888000. Its totient is φ = 3015219200.
The previous prime is 11339732981. The next prime is 11339733011. The reversal of 11339733000 is 33793311.
It is a super-2 number, since 2×113397330002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1071736 + ... + 1082264.
It is an arithmetic number, because the mean of its divisors is an integer number (277202250).
Almost surely, 211339733000 is an apocalyptic number.
11339733000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11339733000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17740944000).
11339733000 is an abundant number, since it is smaller than the sum of its proper divisors (24142155000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11339733000 is a wasteful number, since it uses less digits than its factorization.
11339733000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10912 (or 10898 counting only the distinct ones).
The product of its (nonzero) digits is 5103, while the sum is 30.
The spelling of 11339733000 in words is "eleven billion, three hundred thirty-nine million, seven hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •