Base | Representation |
---|---|
bin | 10000010110000100100… |
… | …101111110010100000100 |
3 | 10222101012111200022110010 |
4 | 100112010211332110010 |
5 | 121400314004330312 |
6 | 2215555050030220 |
7 | 144102134032344 |
oct | 20260445762404 |
9 | 3871174608403 |
10 | 1123211011332 |
11 | 3a3395374393 |
12 | 161829118370 |
13 | 81bc27a86c7 |
14 | 3c514002d24 |
15 | 1e33d59293c |
hex | 1058497e504 |
1123211011332 has 12 divisors (see below), whose sum is σ = 2620825693136. Its totient is φ = 374403670440.
The previous prime is 1123211011243. The next prime is 1123211011333. The reversal of 1123211011332 is 2331101123211.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1123211011299 and 1123211011308.
It is not an unprimeable number, because it can be changed into a prime (1123211011333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46800458794 + ... + 46800458817.
Almost surely, 21123211011332 is an apocalyptic number.
1123211011332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1123211011332 is an abundant number, since it is smaller than the sum of its proper divisors (1497614681804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123211011332 is a wasteful number, since it uses less digits than its factorization.
1123211011332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93600917618 (or 93600917616 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1123211011332 its reverse (2331101123211), we get a palindrome (3454312134543).
The spelling of 1123211011332 in words is "one trillion, one hundred twenty-three billion, two hundred eleven million, eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •