Base | Representation |
---|---|
bin | 1010010010011101001110… |
… | …1111000110011111111011 |
3 | 1111001102202202100102112012 |
4 | 2210213103233012133323 |
5 | 2440314342003332311 |
6 | 40020430431240135 |
7 | 2245164614643041 |
oct | 244472357063773 |
9 | 44042682312465 |
10 | 11312201230331 |
11 | 3671528760141 |
12 | 132846937904b |
13 | 640974cb2781 |
14 | 2b1728d18391 |
15 | 1493ca0d778b |
hex | a49d3bc67fb |
11312201230331 has 16 divisors (see below), whose sum is σ = 11597698295040. Its totient is φ = 11027730601440.
The previous prime is 11312201230313. The next prime is 11312201230357. The reversal of 11312201230331 is 13303210221311.
It is a cyclic number.
It is not a de Polignac number, because 11312201230331 - 226 = 11312134121467 is a prime.
It is a super-2 number, since 2×113122012303312 (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 = 11312201230297 and 11312201230306.
It is not an unprimeable number, because it can be changed into a prime (11312201230361) 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, 141950165 + ... + 142029833.
It is an arithmetic number, because the mean of its divisors is an integer number (724856143440).
Almost surely, 211312201230331 is an apocalyptic number.
11312201230331 is a deficient number, since it is larger than the sum of its proper divisors (285497064709).
11312201230331 is an equidigital number, since it uses as much as digits as its factorization.
11312201230331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86066.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11312201230331 its reverse (13303210221311), we get a palindrome (24615411451642).
The spelling of 11312201230331 in words is "eleven trillion, three hundred twelve billion, two hundred one million, two hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •