Base | Representation |
---|---|
bin | 1001101001011000110111… |
… | …10011110001010110000001 |
3 | 2210002222021001100020222221 |
4 | 10310230123303301112001 |
5 | 10240024324331444413 |
6 | 113041132102531041 |
7 | 4316416412101465 |
oct | 464543363612601 |
9 | 83088231306887 |
10 | 21213310031233 |
11 | 6839572534641 |
12 | 2467346736a81 |
13 | bab539271068 |
14 | 534a303764a5 |
15 | 26bc1831468d |
hex | 134b1bcf1581 |
21213310031233 has 8 divisors (see below), whose sum is σ = 21279595008960. Its totient is φ = 21147065026320.
The previous prime is 21213310031219. The next prime is 21213310031297. The reversal of 21213310031233 is 33213001331212.
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 21213310031233 - 25 = 21213310031201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21213310031198 and 21213310031207.
It is not an unprimeable number, because it can be changed into a prime (21213310031203) 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, 8929983 + ... + 11053108.
It is an arithmetic number, because the mean of its divisors is an integer number (2659949376120).
Almost surely, 221213310031233 is an apocalyptic number.
It is an amenable number.
21213310031233 is a deficient number, since it is larger than the sum of its proper divisors (66284977727).
21213310031233 is a wasteful number, since it uses less digits than its factorization.
21213310031233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19986407.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 21213310031233 its reverse (33213001331212), we get a palindrome (54426311362445).
The spelling of 21213310031233 in words is "twenty-one trillion, two hundred thirteen billion, three hundred ten million, thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •