Base | Representation |
---|---|
bin | 11001000010101000100111… |
… | …111110001000010000110111 |
3 | 112102221112111220120102202211 |
4 | 121002220213332020100313 |
5 | 103413401242313032411 |
6 | 1030122013324114251 |
7 | 32124535062141532 |
oct | 3102504776102067 |
9 | 472845456512684 |
10 | 110132222002231 |
11 | 321008a41a7500 |
12 | 10428442395987 |
13 | 495b56860c1c0 |
14 | 1d2a5dc573a19 |
15 | caebd268c221 |
hex | 642a27f88437 |
110132222002231 has 24 divisors (see below), whose sum is σ = 130367292749120. Its totient is φ = 92417947427520.
The previous prime is 110132222002223. The next prime is 110132222002277. The reversal of 110132222002231 is 132200222231011.
It is not a de Polignac number, because 110132222002231 - 23 = 110132222002223 is a prime.
It is a super-2 number, since 2×1101322220022312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110132222002331) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 386798386 + ... + 387083008.
Almost surely, 2110132222002231 is an apocalyptic number.
110132222002231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110132222002231 is a deficient number, since it is larger than the sum of its proper divisors (20235070746889).
110132222002231 is a wasteful number, since it uses less digits than its factorization.
110132222002231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530647 (or 530636 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 110132222002231 its reverse (132200222231011), we get a palindrome (242332444233242).
The spelling of 110132222002231 in words is "one hundred ten trillion, one hundred thirty-two billion, two hundred twenty-two million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •