Base | Representation |
---|---|
bin | 10000000011011101001… |
… | …010010101110100010000 |
3 | 10220110121110000120112110 |
4 | 100003131022111310100 |
5 | 121033344324301222 |
6 | 2202451354225320 |
7 | 142463605103520 |
oct | 20033512256420 |
9 | 3813543016473 |
10 | 1103222103312 |
11 | 39596813099a |
12 | 15998aa25240 |
13 | 800584b5694 |
14 | 3b5793a7680 |
15 | 1da6d7b830c |
hex | 100dd295d10 |
1103222103312 has 160 divisors (see below), whose sum is σ = 3333971469312. Its totient is φ = 307775043072.
The previous prime is 1103222103281. The next prime is 1103222103337. The reversal of 1103222103312 is 2133012223011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51380803 + ... + 51402269.
Almost surely, 21103222103312 is an apocalyptic number.
1103222103312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1103222103312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1666985734656).
1103222103312 is an abundant number, since it is smaller than the sum of its proper divisors (2230749366000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103222103312 is a wasteful number, since it uses less digits than its factorization.
1103222103312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25085 (or 25079 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1103222103312 its reverse (2133012223011), we get a palindrome (3236234326323).
The spelling of 1103222103312 in words is "one trillion, one hundred three billion, two hundred twenty-two million, one hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •