Base | Representation |
---|---|
bin | 1001100011011110110000… |
… | …00100111111100010011111 |
3 | 2202101120021122101222212111 |
4 | 10301233120010333202133 |
5 | 10223213103404412343 |
6 | 112404000412414451 |
7 | 4265642034216664 |
oct | 461573004774237 |
9 | 82346248358774 |
10 | 21010310232223 |
11 | 6770471430004 |
12 | 2433b32477427 |
13 | b9535760acb0 |
14 | 528c93b01a6b |
15 | 2667d683ac9d |
hex | 131bd813f89f |
21010310232223 has 4 divisors (see below), whose sum is σ = 22626487942408. Its totient is φ = 19394132522040.
The previous prime is 21010310232199. The next prime is 21010310232257. The reversal of 21010310232223 is 32223201301012.
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 21010310232223 - 213 = 21010310224031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010310232194 and 21010310232203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010310232823) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 808088855073 + ... + 808088855098.
It is an arithmetic number, because the mean of its divisors is an integer number (5656621985602).
Almost surely, 221010310232223 is an apocalyptic number.
21010310232223 is a deficient number, since it is larger than the sum of its proper divisors (1616177710185).
21010310232223 is a wasteful number, since it uses less digits than its factorization.
21010310232223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1616177710184.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21010310232223 its reverse (32223201301012), we get a palindrome (53233511533235).
The spelling of 21010310232223 in words is "twenty-one trillion, ten billion, three hundred ten million, two hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •