Base | Representation |
---|---|
bin | 1001100011110011001111… |
… | …01110101000001010101111 |
3 | 2202102121200020211102111011 |
4 | 10301321213232220022233 |
5 | 10223403120404114043 |
6 | 112413020120410051 |
7 | 4266511443464005 |
oct | 461714756501257 |
9 | 82377606742434 |
10 | 21021310223023 |
11 | 67750a66619a0 |
12 | 24360a2316927 |
13 | b963bb5313a6 |
14 | 5296189aca75 |
15 | 266c2c3c759d |
hex | 131e67ba82af |
21021310223023 has 4 divisors (see below), whose sum is σ = 22932338425128. Its totient is φ = 19110282020920.
The previous prime is 21021310222993. The next prime is 21021310223029. The reversal of 21021310223023 is 32032201312012.
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 21021310223023 - 237 = 20883871269551 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21021310222985 and 21021310223003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021310223029) 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, 955514101036 + ... + 955514101057.
It is an arithmetic number, because the mean of its divisors is an integer number (5733084606282).
Almost surely, 221021310223023 is an apocalyptic number.
21021310223023 is a deficient number, since it is larger than the sum of its proper divisors (1911028202105).
21021310223023 is a wasteful number, since it uses less digits than its factorization.
21021310223023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1911028202104.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21021310223023 its reverse (32032201312012), we get a palindrome (53053511535035).
The spelling of 21021310223023 in words is "twenty-one trillion, twenty-one billion, three hundred ten million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •