Base | Representation |
---|---|
bin | 1010010011100100011011… |
… | …0101101010111001011110 |
3 | 1111010021002122000100020011 |
4 | 2210321012311222321132 |
5 | 2441123011410420220 |
6 | 40033311041513434 |
7 | 2246442323343433 |
oct | 244710665527136 |
9 | 44107078010204 |
10 | 11331312201310 |
11 | 3679645370532 |
12 | 133010164287a |
13 | 6426cc43551a |
14 | 2b261d0dbb8a |
15 | 149b47c9265a |
hex | a4e46d6ae5e |
11331312201310 has 8 divisors (see below), whose sum is σ = 20396361962376. Its totient is φ = 4532524880520.
The previous prime is 11331312201277. The next prime is 11331312201311. The reversal of 11331312201310 is 1310221313311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×113313122013102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331312201311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 566565610056 + ... + 566565610075.
It is an arithmetic number, because the mean of its divisors is an integer number (2549545245297).
Almost surely, 211331312201310 is an apocalyptic number.
11331312201310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331312201310 is a deficient number, since it is larger than the sum of its proper divisors (9065049761066).
11331312201310 is a wasteful number, since it uses less digits than its factorization.
11331312201310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1133131220138.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11331312201310 its reverse (1310221313311), we get a palindrome (12641533514621).
The spelling of 11331312201310 in words is "eleven trillion, three hundred thirty-one billion, three hundred twelve million, two hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •