Base | Representation |
---|---|
bin | 1010010010011100110111… |
… | …0001001110000011111111 |
3 | 1111001102111202222102010110 |
4 | 2210213031301032003333 |
5 | 2440314140341403203 |
6 | 40020412453441103 |
7 | 2245162261020642 |
oct | 244471561160377 |
9 | 44042452872113 |
10 | 11312101122303 |
11 | 36714871a5533 |
12 | 132843b940193 |
13 | 64095a331a57 |
14 | 2b17198d9a59 |
15 | 1493c1410d03 |
hex | a49cdc4e0ff |
11312101122303 has 8 divisors (see below), whose sum is σ = 15238294295728. Its totient is φ = 7463654348544.
The previous prime is 11312101122293. The next prime is 11312101122383. The reversal of 11312101122303 is 30322110121311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11312101122303 - 212 = 11312101118207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11312101122303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11312101122383) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19436599576 + ... + 19436600157.
It is an arithmetic number, because the mean of its divisors is an integer number (1904786786966).
Almost surely, 211312101122303 is an apocalyptic number.
11312101122303 is a deficient number, since it is larger than the sum of its proper divisors (3926193173425).
11312101122303 is an equidigital number, since it uses as much as digits as its factorization.
11312101122303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38873199833.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11312101122303 its reverse (30322110121311), we get a palindrome (41634211243614).
The spelling of 11312101122303 in words is "eleven trillion, three hundred twelve billion, one hundred one million, one hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •