Base | Representation |
---|---|
bin | 100001110010111011001… |
… | …101001000010110010111 |
3 | 22020000120122211110111101 |
4 | 201302323031020112113 |
5 | 301022310304340203 |
6 | 4534523443250531 |
7 | 326534544550045 |
oct | 41627315102627 |
9 | 8200518743441 |
10 | 2322423121303 |
11 | 815a30340a9a |
12 | 316126979a47 |
13 | 13b007a9059c |
14 | 80597a35395 |
15 | 40628ee941d |
hex | 21cbb348597 |
2322423121303 has 8 divisors (see below), whose sum is σ = 2403219476880. Its totient is φ = 2241674285760.
The previous prime is 2322423121289. The next prime is 2322423121313. The reversal of 2322423121303 is 3031213242232.
2322423121303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2322423121303 - 29 = 2322423120791 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 (2322423121313) 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, 11780550 + ... + 11976067.
It is an arithmetic number, because the mean of its divisors is an integer number (300402434610).
Almost surely, 22322423121303 is an apocalyptic number.
2322423121303 is a deficient number, since it is larger than the sum of its proper divisors (80796355577).
2322423121303 is a wasteful number, since it uses less digits than its factorization.
2322423121303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23760017.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 2322423121303 its reverse (3031213242232), we get a palindrome (5353636363535).
The spelling of 2322423121303 in words is "two trillion, three hundred twenty-two billion, four hundred twenty-three million, one hundred twenty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •