Base | Representation |
---|---|
bin | 1001100111000101100110… |
… | …01000000110111000011011 |
3 | 2202211102011211022011020110 |
4 | 10303202303020012320123 |
5 | 10232230413022441243 |
6 | 112540534322455403 |
7 | 4310620163614026 |
oct | 463426310067033 |
9 | 82742154264213 |
10 | 21134244343323 |
11 | 6808a89a66011 |
12 | 2453b5b804563 |
13 | ba3c48887547 |
14 | 530c8d72a1bd |
15 | 269b3bd9de33 |
hex | 1338b3206e1b |
21134244343323 has 8 divisors (see below), whose sum is σ = 28179014503936. Its totient is φ = 14089485205800.
The previous prime is 21134244343283. The next prime is 21134244343363. The reversal of 21134244343323 is 32334344243112.
It is an interprime number because it is at equal distance from previous prime (21134244343283) and next prime (21134244343363).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21134244343323 - 29 = 21134244342811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21134244343363) 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, 4294878 + ... + 7791948.
It is an arithmetic number, because the mean of its divisors is an integer number (3522376812992).
Almost surely, 221134244343323 is an apocalyptic number.
21134244343323 is a deficient number, since it is larger than the sum of its proper divisors (7044770160613).
21134244343323 is a wasteful number, since it uses less digits than its factorization.
21134244343323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5511545.
The product of its digits is 497664, while the sum is 39.
Adding to 21134244343323 its reverse (32334344243112), we get a palindrome (53468588586435).
The spelling of 21134244343323 in words is "twenty-one trillion, one hundred thirty-four billion, two hundred forty-four million, three hundred forty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •