Base | Representation |
---|---|
bin | 1010001101101011011010… |
… | …1110101100011001011011 |
3 | 1110202120212200121021202021 |
4 | 2203122312232230121123 |
5 | 2432443231203034111 |
6 | 35515012535515311 |
7 | 2236230412515160 |
oct | 243326656543133 |
9 | 43676780537667 |
10 | 11230110205531 |
11 | 363a732496198 |
12 | 1314579228b37 |
13 | 635cc18b3099 |
14 | 2ab77c58c067 |
15 | 1471c3275d71 |
hex | a36b6bac65b |
11230110205531 has 16 divisors (see below), whose sum is σ = 13134081210624. Its totient is φ = 9401097321504.
The previous prime is 11230110205481. The next prime is 11230110205543. The reversal of 11230110205531 is 13550201103211.
It is not a de Polignac number, because 11230110205531 - 215 = 11230110172763 is a prime.
It is a super-2 number, since 2×112301102055312 (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 = 11230110205496 and 11230110205505.
It is not an unprimeable number, because it can be changed into a prime (11230110205331) 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, 1627401 + ... + 5010853.
It is an arithmetic number, because the mean of its divisors is an integer number (820880075664).
Almost surely, 211230110205531 is an apocalyptic number.
11230110205531 is a deficient number, since it is larger than the sum of its proper divisors (1903971005093).
11230110205531 is a wasteful number, since it uses less digits than its factorization.
11230110205531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3394530.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 11230110205531 its reverse (13550201103211), we get a palindrome (24780311308742).
The spelling of 11230110205531 in words is "eleven trillion, two hundred thirty billion, one hundred ten million, two hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •