Base | Representation |
---|---|
bin | 100001101010010000001… |
… | …011000011010000110111 |
3 | 22012010112200211221010012 |
4 | 201222100023003100313 |
5 | 300344222433040203 |
6 | 4530343441050435 |
7 | 326055023654411 |
oct | 41522013032067 |
9 | 8163480757105 |
10 | 2313111221303 |
11 | 811a91a88773 |
12 | 314368326a1b |
13 | 13a182806b9c |
14 | 7dd5302d9b1 |
15 | 4028175cbd8 |
hex | 21a902c3437 |
2313111221303 has 8 divisors (see below), whose sum is σ = 2533630952880. Its totient is φ = 2101975308160.
The previous prime is 2313111221263. The next prime is 2313111221327. The reversal of 2313111221303 is 3031221113132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2313111221303 - 234 = 2295931352119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313111721303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2345954093 + ... + 2345955078.
It is an arithmetic number, because the mean of its divisors is an integer number (316703869110).
Almost surely, 22313111221303 is an apocalyptic number.
2313111221303 is a deficient number, since it is larger than the sum of its proper divisors (220519731577).
2313111221303 is a wasteful number, since it uses less digits than its factorization.
2313111221303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4691909217.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 2313111221303 its reverse (3031221113132), we get a palindrome (5344332334435).
The spelling of 2313111221303 in words is "two trillion, three hundred thirteen billion, one hundred eleven million, two hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •