Base | Representation |
---|---|
bin | 11001000100000110100000… |
… | …001000000100100010010011 |
3 | 112110022011200211210002011220 |
4 | 121010012200020010202103 |
5 | 103422024212130402011 |
6 | 1030240203512340123 |
7 | 32135034023053236 |
oct | 3104064010044223 |
9 | 473264624702156 |
10 | 110233022122131 |
11 | 3213a620245517 |
12 | 10443a940a4643 |
13 | 4967c10b1426c |
14 | 1d3144199141d |
15 | cb2631c74506 |
hex | 6441a0204893 |
110233022122131 has 8 divisors (see below), whose sum is σ = 149750520618960. Its totient is φ = 72102102520032.
The previous prime is 110233022122127. The next prime is 110233022122193. The reversal of 110233022122131 is 131221220332011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110233022122131 - 22 = 110233022122127 is a prime.
It is a super-2 number, since 2×1102330221221312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110233022172131) 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, 346644723496 + ... + 346644723813.
It is an arithmetic number, because the mean of its divisors is an integer number (18718815077370).
Almost surely, 2110233022122131 is an apocalyptic number.
110233022122131 is a deficient number, since it is larger than the sum of its proper divisors (39517498496829).
110233022122131 is an equidigital number, since it uses as much as digits as its factorization.
110233022122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693289447365.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 110233022122131 its reverse (131221220332011), we get a palindrome (241454242454142).
The spelling of 110233022122131 in words is "one hundred ten trillion, two hundred thirty-three billion, twenty-two million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •