Base | Representation |
---|---|
bin | 10100111000010111… |
… | …01111111100000110 |
3 | 1001221021002020001100 |
4 | 22130023233330012 |
5 | 140424311311410 |
6 | 5052214440530 |
7 | 544541432301 |
oct | 123413577406 |
9 | 31837066040 |
10 | 11210260230 |
11 | 4832999484 |
12 | 220a363146 |
13 | 1098664aa0 |
14 | 784ba3b38 |
15 | 4592738c0 |
hex | 29c2eff06 |
11210260230 has 48 divisors (see below), whose sum is σ = 31388731920. Its totient is φ = 2759448384.
The previous prime is 11210260211. The next prime is 11210260273. The reversal of 11210260230 is 3206201211.
11210260230 is a `hidden beast` number, since 11 + 21 + 0 + 2 + 602 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 4789540 + ... + 4791879.
It is an arithmetic number, because the mean of its divisors is an integer number (653931915).
Almost surely, 211210260230 is an apocalyptic number.
11210260230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11210260230 is an abundant number, since it is smaller than the sum of its proper divisors (20178471690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210260230 is a wasteful number, since it uses less digits than its factorization.
11210260230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9581445 (or 9581442 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11210260230 its reverse (3206201211), we get a palindrome (14416461441).
The spelling of 11210260230 in words is "eleven billion, two hundred ten million, two hundred sixty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •