Base | Representation |
---|---|
bin | 1010010010011101100110… |
… | …1100011101001111000011 |
3 | 1111001110000201110102120111 |
4 | 2210213121230131033003 |
5 | 2440320043101402243 |
6 | 40020444402052151 |
7 | 2245200240451534 |
oct | 244473154351703 |
9 | 44043021412514 |
10 | 11312301200323 |
11 | 367157a131072 |
12 | 132849694a057 |
13 | 64098c915706 |
14 | 2b17382dc68b |
15 | 1493d3c8339d |
hex | a49d9b1d3c3 |
11312301200323 has 16 divisors (see below), whose sum is σ = 11745648684000. Its totient is φ = 10885821520896.
The previous prime is 11312301200309. The next prime is 11312301200327. The reversal of 11312301200323 is 32300210321311.
It is a cyclic number.
It is not a de Polignac number, because 11312301200323 - 237 = 11174862246851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11312301200294 and 11312301200303.
It is not an unprimeable number, because it can be changed into a prime (11312301200327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4328565 + ... + 6431257.
It is an arithmetic number, because the mean of its divisors is an integer number (734103042750).
Almost surely, 211312301200323 is an apocalyptic number.
11312301200323 is a deficient number, since it is larger than the sum of its proper divisors (433347483677).
11312301200323 is a wasteful number, since it uses less digits than its factorization.
11312301200323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2104326.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11312301200323 its reverse (32300210321311), we get a palindrome (43612511521634).
The spelling of 11312301200323 in words is "eleven trillion, three hundred twelve billion, three hundred one million, two hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •