Base | Representation |
---|---|
bin | 1001101001101010111011… |
… | …11111011110110110000001 |
3 | 2210010220022002011121002221 |
4 | 10310311131333132312001 |
5 | 10240204211121111113 |
6 | 113045414422011041 |
7 | 4320211660226026 |
oct | 464653577366601 |
9 | 83126262147087 |
10 | 21223010332033 |
11 | 68426a0060164 |
12 | 24691b3276a81 |
13 | bac423b37613 |
14 | 5352b07a354d |
15 | 26c0d4c2298d |
hex | 134d5dfded81 |
21223010332033 has 8 divisors (see below), whose sum is σ = 21227149785600. Its totient is φ = 21218871262848.
The previous prime is 21223010332031. The next prime is 21223010332037. The reversal of 21223010332033 is 33023301032212.
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 21223010332033 - 21 = 21223010332031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21223010331989 and 21223010332007.
It is not an unprimeable number, because it can be changed into a prime (21223010332031) 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, 125978385 + ... + 126146737.
It is an arithmetic number, because the mean of its divisors is an integer number (2653393723200).
Almost surely, 221223010332033 is an apocalyptic number.
It is an amenable number.
21223010332033 is a deficient number, since it is larger than the sum of its proper divisors (4139453567).
21223010332033 is a wasteful number, since it uses less digits than its factorization.
21223010332033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192191.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 21223010332033 its reverse (33023301032212), we get a palindrome (54246311364245).
The spelling of 21223010332033 in words is "twenty-one trillion, two hundred twenty-three billion, ten million, three hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •