Base | Representation |
---|---|
bin | 1001101100000000001001… |
… | …11010011111101100110111 |
3 | 2210102120002002002010110021 |
4 | 10312000010322133230313 |
5 | 10243012242234344343 |
6 | 113150303543110011 |
7 | 4326046115152315 |
oct | 466000472375467 |
9 | 83376062063407 |
10 | 21303120231223 |
11 | 6873669aaa116 |
12 | 248082ba42307 |
13 | bb6b4c96a92c |
14 | 53910dd890b5 |
15 | 26e222b9e0ed |
hex | 136004e9fb37 |
21303120231223 has 4 divisors (see below), whose sum is σ = 21304229037208. Its totient is φ = 21302011425240.
The previous prime is 21303120231137. The next prime is 21303120231257. The reversal of 21303120231223 is 32213202130312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21303120231223 - 237 = 21165681277751 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 (21303120231293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 554374173 + ... + 554412598.
It is an arithmetic number, because the mean of its divisors is an integer number (5326057259302).
Almost surely, 221303120231223 is an apocalyptic number.
21303120231223 is a deficient number, since it is larger than the sum of its proper divisors (1108805985).
21303120231223 is a wasteful number, since it uses less digits than its factorization.
21303120231223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108805984.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 21303120231223 its reverse (32213202130312), we get a palindrome (53516322361535).
The spelling of 21303120231223 in words is "twenty-one trillion, three hundred three billion, one hundred twenty million, two hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •