Base | Representation |
---|---|
bin | 10100111010101111… |
… | …00011001110011100 |
3 | 1001222122110202202111 |
4 | 22131113203032130 |
5 | 140444403143400 |
6 | 5054204403404 |
7 | 545202352666 |
oct | 123527431634 |
9 | 31878422674 |
10 | 11230131100 |
11 | 4843130791 |
12 | 2214b46564 |
13 | 109c8014b6 |
14 | 787697536 |
15 | 45ad9b3ba |
hex | 29d5e339c |
11230131100 has 36 divisors (see below), whose sum is σ = 25209714600. Its totient is φ = 4337152960.
The previous prime is 11230131023. The next prime is 11230131103. The reversal of 11230131100 is 113103211.
It is a super-2 number, since 2×112301311002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230131103) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1933330 + ... + 1939129.
It is an arithmetic number, because the mean of its divisors is an integer number (700269850).
Almost surely, 211230131100 is an apocalyptic number.
11230131100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11230131100 is an abundant number, since it is smaller than the sum of its proper divisors (13979583500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11230131100 is a wasteful number, since it uses less digits than its factorization.
11230131100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3872502 (or 3872495 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11230131100 its reverse (113103211), we get a palindrome (11343234311).
The spelling of 11230131100 in words is "eleven billion, two hundred thirty million, one hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •