Base | Representation |
---|---|
bin | 1001101001011000010101… |
… | …00010100101100110100111 |
3 | 2210002221111212012002200220 |
4 | 10310230022202211212213 |
5 | 10240023231200022043 |
6 | 113041043233135423 |
7 | 4316406263410056 |
oct | 464541242454647 |
9 | 83087455162626 |
10 | 21213020314023 |
11 | 6839433a4382a |
12 | 24672856ba573 |
13 | bab4c1233765 |
14 | 534a03abc39d |
15 | 26bbecb87483 |
hex | 134b0a8a59a7 |
21213020314023 has 4 divisors (see below), whose sum is σ = 28284027085368. Its totient is φ = 14142013542680.
The previous prime is 21213020314021. The next prime is 21213020314037. The reversal of 21213020314023 is 32041302031212.
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 21213020314023 - 21 = 21213020314021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21213020313984 and 21213020314002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21213020314021) 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, 3535503385668 + ... + 3535503385673.
It is an arithmetic number, because the mean of its divisors is an integer number (7071006771342).
Almost surely, 221213020314023 is an apocalyptic number.
21213020314023 is a deficient number, since it is larger than the sum of its proper divisors (7071006771345).
21213020314023 is an equidigital number, since it uses as much as digits as its factorization.
21213020314023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7071006771344.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 21213020314023 its reverse (32041302031212), we get a palindrome (53254322345235).
The spelling of 21213020314023 in words is "twenty-one trillion, two hundred thirteen billion, twenty million, three hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •