Base | Representation |
---|---|
bin | 1001101001111101110010… |
… | …01110111000111010101001 |
3 | 2210011212102102001102210002 |
4 | 10310332321032320322221 |
5 | 10240340423021012413 |
6 | 113054210555432345 |
7 | 4321020531606431 |
oct | 464767116707251 |
9 | 83155372042702 |
10 | 21233131032233 |
11 | 6846a13a14aaa |
12 | 246b1587556b5 |
13 | bb0377835613 |
14 | 5359909852c1 |
15 | 26c4c84c3958 |
hex | 134fb93b8ea9 |
21233131032233 has 8 divisors (see below), whose sum is σ = 21365312855040. Its totient is φ = 21101009177920.
The previous prime is 21233131032193. The next prime is 21233131032299. The reversal of 21233131032233 is 33223013133212.
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 21233131032233 - 210 = 21233131031209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21233131032196 and 21233131032205.
It is not an unprimeable number, because it can be changed into a prime (21233131038233) 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, 14281673 + ... + 15698166.
It is an arithmetic number, because the mean of its divisors is an integer number (2670664106880).
Almost surely, 221233131032233 is an apocalyptic number.
It is an amenable number.
21233131032233 is a deficient number, since it is larger than the sum of its proper divisors (132181822807).
21233131032233 is a wasteful number, since it uses less digits than its factorization.
21233131032233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29984247.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 21233131032233 its reverse (33223013133212), we get a palindrome (54456144165445).
The spelling of 21233131032233 in words is "twenty-one trillion, two hundred thirty-three billion, one hundred thirty-one million, thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •