Base | Representation |
---|---|
bin | 10000010101111010000… |
… | …000000110111011111110 |
3 | 10222100202010022022012020 |
4 | 100111322000012323332 |
5 | 121344433012004042 |
6 | 2215525301221010 |
7 | 144064545441435 |
oct | 20257200067376 |
9 | 3870663268166 |
10 | 1123033313022 |
11 | 3a3304033a85 |
12 | 161799701766 |
13 | 81b94a2c38a |
14 | 3c4d858811c |
15 | 1e32cb913ec |
hex | 1057a006efe |
1123033313022 has 8 divisors (see below), whose sum is σ = 2246066626056. Its totient is φ = 374344437672.
The previous prime is 1123033313009. The next prime is 1123033313071. The reversal of 1123033313022 is 2203133303211.
It is a sphenic number, since it is the product of 3 distinct primes.
1123033313022 is an admirable number.
It is a super-2 number, since 2×11230333130222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123033312983 and 1123033313001.
It is a congruent number.
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, 93586109413 + ... + 93586109424.
It is an arithmetic number, because the mean of its divisors is an integer number (280758328257).
Almost surely, 21123033313022 is an apocalyptic number.
1123033313022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123033313022 is a wasteful number, since it uses less digits than its factorization.
1123033313022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187172218842.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 1123033313022 its reverse (2203133303211), we get a palindrome (3326166616233).
The spelling of 1123033313022 in words is "one trillion, one hundred twenty-three billion, thirty-three million, three hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •