Base | Representation |
---|---|
bin | 11110000100010100101… |
… | …01110011100100111011 |
3 | 10122202122102121100221212 |
4 | 33002022111303210323 |
5 | 113411303424420011 |
6 | 2110334451353335 |
7 | 134432335440425 |
oct | 17021225634473 |
9 | 3582572540855 |
10 | 1033113123131 |
11 | 369160474461 |
12 | 1482835b284b |
13 | 76564601c1b |
14 | 38008103815 |
15 | 1bd1882c08b |
hex | f08a57393b |
1033113123131 has 8 divisors (see below), whose sum is σ = 1043064252720. Its totient is φ = 1023167472768.
The previous prime is 1033113123089. The next prime is 1033113123143. The reversal of 1033113123131 is 1313213113301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1033113123131 - 218 = 1033112860987 is a prime.
It is a super-2 number, since 2×10331131231312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1033113123097 and 1033113123106.
It is not an unprimeable number, because it can be changed into a prime (1033113123431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 990386 + ... + 1745591.
It is an arithmetic number, because the mean of its divisors is an integer number (130383031590).
Almost surely, 21033113123131 is an apocalyptic number.
1033113123131 is a deficient number, since it is larger than the sum of its proper divisors (9951129589).
1033113123131 is a wasteful number, since it uses less digits than its factorization.
1033113123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2739613.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1033113123131 its reverse (1313213113301), we get a palindrome (2346326236432).
The spelling of 1033113123131 in words is "one trillion, thirty-three billion, one hundred thirteen million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •