Base | Representation |
---|---|
bin | 1010001101101100010000… |
… | …0001110110111010001011 |
3 | 1110202121110020110100021110 |
4 | 2203123010001312322023 |
5 | 2432444210313130011 |
6 | 35515051030141403 |
7 | 2236236062206023 |
oct | 243330401667213 |
9 | 43677406410243 |
10 | 11230333333131 |
11 | 363a837435270 |
12 | 131461bab1863 |
13 | 636028ba7253 |
14 | 2ab7a0070a83 |
15 | 1471d7b4cba6 |
hex | a36c4076e8b |
11230333333131 has 32 divisors (see below), whose sum is σ = 16429963829760. Its totient is φ = 6766795411200.
The previous prime is 11230333333069. The next prime is 11230333333157. The reversal of 11230333333131 is 13133333303211.
It is not a de Polignac number, because 11230333333131 - 26 = 11230333333067 is a prime.
It is a super-2 number, since 2×112303333331312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11230333333181) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3977610 + ... + 6187248.
It is an arithmetic number, because the mean of its divisors is an integer number (513436369680).
Almost surely, 211230333333131 is an apocalyptic number.
11230333333131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11230333333131 is a deficient number, since it is larger than the sum of its proper divisors (5199630496629).
11230333333131 is a wasteful number, since it uses less digits than its factorization.
11230333333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2210547.
The product of its (nonzero) digits is 13122, while the sum is 30.
Adding to 11230333333131 its reverse (13133333303211), we get a palindrome (24363666636342).
The spelling of 11230333333131 in words is "eleven trillion, two hundred thirty billion, three hundred thirty-three million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •