Base | Representation |
---|---|
bin | 1001101001111101100010… |
… | …11011000101011010101001 |
3 | 2210011212002021111220000212 |
4 | 10310332301123011122221 |
5 | 10240340141000331213 |
6 | 113054145555310505 |
7 | 4321014351134540 |
oct | 464766133053251 |
9 | 83155067456025 |
10 | 21233000011433 |
11 | 6846956a66151 |
12 | 246b1208ab435 |
13 | bb0356650312 |
14 | 53597b3db157 |
15 | 26c4bbc429a8 |
hex | 134fb16c56a9 |
21233000011433 has 8 divisors (see below), whose sum is σ = 24292183585152. Its totient is φ = 18180290902176.
The previous prime is 21233000011387. The next prime is 21233000011439. The reversal of 21233000011433 is 33411000033212.
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 21233000011433 - 28 = 21233000011177 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21233000011399 and 21233000011408.
It is not an unprimeable number, because it can be changed into a prime (21233000011439) 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, 1618609085 + ... + 1618622202.
It is an arithmetic number, because the mean of its divisors is an integer number (3036522948144).
Almost surely, 221233000011433 is an apocalyptic number.
It is an amenable number.
21233000011433 is a deficient number, since it is larger than the sum of its proper divisors (3059183573719).
21233000011433 is an equidigital number, since it uses as much as digits as its factorization.
21233000011433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3237232231.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21233000011433 its reverse (33411000033212), we get a palindrome (54644000044645).
The spelling of 21233000011433 in words is "twenty-one trillion, two hundred thirty-three billion, eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •