Base | Representation |
---|---|
bin | 1010010101100101110000… |
… | …1111111100110101011111 |
3 | 1111020120201020211200211122 |
4 | 2211121130033330311133 |
5 | 2442210112433303211 |
6 | 40101252125241155 |
7 | 2252111563501436 |
oct | 245313417746537 |
9 | 44216636750748 |
10 | 11366031150431 |
11 | 36923412aa911 |
12 | 1336990a031bb |
13 | 645a733643b9 |
14 | 2b419416811d |
15 | 14a9cad086db |
hex | a565c3fcd5f |
11366031150431 has 8 divisors (see below), whose sum is σ = 11368853874000. Its totient is φ = 11363208788800.
The previous prime is 11366031150359. The next prime is 11366031150443. The reversal of 11366031150431 is 13405113066311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11366031150431 - 234 = 11348851281247 is a prime.
It is a super-2 number, since 2×113660311504312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11366031150391 and 11366031150400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11366031150631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69138131 + ... + 69302331.
It is an arithmetic number, because the mean of its divisors is an integer number (1421106734250).
Almost surely, 211366031150431 is an apocalyptic number.
11366031150431 is a deficient number, since it is larger than the sum of its proper divisors (2822723569).
11366031150431 is an equidigital number, since it uses as much as digits as its factorization.
11366031150431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180969.
The product of its (nonzero) digits is 19440, while the sum is 35.
The spelling of 11366031150431 in words is "eleven trillion, three hundred sixty-six billion, thirty-one million, one hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •