Base | Representation |
---|---|
bin | 10000010101111000001… |
… | …001001000010001000100 |
3 | 10222100122221121200222112 |
4 | 100111320021020101010 |
5 | 121344402020421312 |
6 | 2215522224520152 |
7 | 144064016356415 |
oct | 20257011102104 |
9 | 3870587550875 |
10 | 1123002123332 |
11 | 3a3298470781 |
12 | 16178b180058 |
13 | 81b8b42ba3b |
14 | 3c4d438980c |
15 | 1e32a07ed22 |
hex | 10578248444 |
1123002123332 has 12 divisors (see below), whose sum is σ = 1969813472256. Its totient is φ = 560198274120.
The previous prime is 1123002123319. The next prime is 1123002123337. The reversal of 1123002123332 is 2333212003211.
It is a super-2 number, since 2×11230021233322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123002123298 and 1123002123307.
It is not an unprimeable number, because it can be changed into a prime (1123002123337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 325694948 + ... + 325698395.
It is an arithmetic number, because the mean of its divisors is an integer number (164151122688).
Almost surely, 21123002123332 is an apocalyptic number.
It is an amenable number.
1123002123332 is a deficient number, since it is larger than the sum of its proper divisors (846811348924).
1123002123332 is a wasteful number, since it uses less digits than its factorization.
1123002123332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651393778 (or 651393776 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1123002123332 its reverse (2333212003211), we get a palindrome (3456214126543).
The spelling of 1123002123332 in words is "one trillion, one hundred twenty-three billion, two million, one hundred twenty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •