Base | Representation |
---|---|
bin | 10011110001000000… |
… | …100001001110100111 |
3 | 2000210002102002001101 |
4 | 103301000201032213 |
5 | 321431132024333 |
6 | 13425545140531 |
7 | 1350635124010 |
oct | 236100411647 |
9 | 60702362041 |
10 | 21223314343 |
11 | 900100a210 |
12 | 414378a747 |
13 | 2002c72c8a |
14 | 1054964007 |
15 | 84335e67d |
hex | 4f10213a7 |
21223314343 has 8 divisors (see below), whose sum is σ = 26460236160. Its totient is φ = 16537647480.
The previous prime is 21223314341. The next prime is 21223314353. The reversal of 21223314343 is 34341332212.
It is a happy number.
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 21223314343 - 21 = 21223314341 is a prime.
It is a super-3 number, since 3×212233143433 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21223314341) 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, 137813653 + ... + 137813806.
It is an arithmetic number, because the mean of its divisors is an integer number (3307529520).
Almost surely, 221223314343 is an apocalyptic number.
21223314343 is a deficient number, since it is larger than the sum of its proper divisors (5236921817).
21223314343 is a wasteful number, since it uses less digits than its factorization.
21223314343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275627477.
The product of its digits is 10368, while the sum is 28.
Adding to 21223314343 its reverse (34341332212), we get a palindrome (55564646555).
It can be divided in two parts, 212233 and 14343, that added together give a square (226576 = 4762).
The spelling of 21223314343 in words is "twenty-one billion, two hundred twenty-three million, three hundred fourteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •