Base | Representation |
---|---|
bin | 10100101111001010… |
… | …11010100010000010 |
3 | 1001201212220012010220 |
4 | 22113211122202002 |
5 | 140300033232320 |
6 | 5040421003510 |
7 | 542613543636 |
oct | 122745324202 |
9 | 31655805126 |
10 | 11133102210 |
11 | 47a338951a |
12 | 21a8553596 |
13 | 108568b159 |
14 | 77883adc6 |
15 | 4525d1e40 |
hex | 29795a882 |
11133102210 has 32 divisors (see below), whose sum is σ = 26737964352. Its totient is φ = 2966769600.
The previous prime is 11133102119. The next prime is 11133102217. The reversal of 11133102210 is 1220133111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11133102210.
It is not an unprimeable number, because it can be changed into a prime (11133102217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84349 + ... + 171408.
It is an arithmetic number, because the mean of its divisors is an integer number (835561386).
Almost surely, 211133102210 is an apocalyptic number.
11133102210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11133102210 is an abundant number, since it is smaller than the sum of its proper divisors (15604862142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11133102210 is a wasteful number, since it uses less digits than its factorization.
11133102210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257218.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11133102210 its reverse (1220133111), we get a palindrome (12353235321).
The spelling of 11133102210 in words is "eleven billion, one hundred thirty-three million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •