Base | Representation |
---|---|
bin | 10000010110000101001… |
… | …100011110001010000000 |
3 | 10222101020012200000221012 |
4 | 100112011030132022000 |
5 | 121400324100300412 |
6 | 2220000050220052 |
7 | 144102315563654 |
oct | 20260514361200 |
9 | 3871205600835 |
10 | 1123221103232 |
11 | 3a33a00375a8 |
12 | 161830584628 |
13 | 81bc4900047 |
14 | 3c5154aca64 |
15 | 1e33e3d7c22 |
hex | 1058531e280 |
1123221103232 has 32 divisors (see below), whose sum is σ = 2247029726400. Its totient is φ = 559260701440.
The previous prime is 1123221103229. The next prime is 1123221103259. The reversal of 1123221103232 is 2323011223211.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×11232211032322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123221103198 and 1123221103207.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18327494 + ... + 18388677.
It is an arithmetic number, because the mean of its divisors is an integer number (70219678950).
Almost surely, 21123221103232 is an apocalyptic number.
It is an amenable number.
1123221103232 is an abundant number, since it is smaller than the sum of its proper divisors (1123808623168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123221103232 is an equidigital number, since it uses as much as digits as its factorization.
1123221103232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36716424 (or 36716412 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1123221103232 its reverse (2323011223211), we get a palindrome (3446232326443).
The spelling of 1123221103232 in words is "one trillion, one hundred twenty-three billion, two hundred twenty-one million, one hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •