Base | Representation |
---|---|
bin | 1010010010010101110001… |
… | …1101000011101000110000 |
3 | 1111001020121021200222010021 |
4 | 2210211130131003220300 |
5 | 2440301242200330222 |
6 | 40015500102213224 |
7 | 2245064204603206 |
oct | 244453435035060 |
9 | 44036537628107 |
10 | 11310200011312 |
11 | 36706a1060724 |
12 | 1327bab124214 |
13 | 6407164cc5c7 |
14 | 2b15b9223076 |
15 | 14930e583ac7 |
hex | a495c743a30 |
11310200011312 has 10 divisors (see below), whose sum is σ = 21913512521948. Its totient is φ = 5655100005648.
The previous prime is 11310200011309. The next prime is 11310200011337. The reversal of 11310200011312 is 21311000201311.
It is a happy number.
It is a super-2 number, since 2×113102000113122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 706887500707 = 11310200011312 / (1 + 1 + 3 + 1 + 0 + 2 + 0 + 0 + 0 + 1 + 1 + 3 + 1 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 353443750338 + ... + 353443750369.
Almost surely, 211310200011312 is an apocalyptic number.
It is an amenable number.
11310200011312 is a deficient number, since it is larger than the sum of its proper divisors (10603312510636).
11310200011312 is an equidigital number, since it uses as much as digits as its factorization.
11310200011312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706887500715 (or 706887500709 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11310200011312 its reverse (21311000201311), we get a palindrome (32621200212623).
The spelling of 11310200011312 in words is "eleven trillion, three hundred ten billion, two hundred million, eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •