Base | Representation |
---|---|
bin | 11110000010010011100… |
… | …11001101001011010001 |
3 | 10122122211222002211010100 |
4 | 33001021303031023101 |
5 | 113402044224423441 |
6 | 2110035211123013 |
7 | 134363446622205 |
oct | 17011163151321 |
9 | 3578758084110 |
10 | 1032030311121 |
11 | 3687552297a7 |
12 | 148020a43469 |
13 | 7642118b764 |
14 | 37d4439ab05 |
15 | 1bca373dcb6 |
hex | f049ccd2d1 |
1032030311121 has 12 divisors (see below), whose sum is σ = 1491372722320. Its totient is φ = 687714543000.
The previous prime is 1032030311051. The next prime is 1032030311149. The reversal of 1032030311121 is 1211130302301.
1032030311121 is a `hidden beast` number, since 1 + 0 + 320 + 30 + 311 + 1 + 2 + 1 = 666.
It is not a de Polignac number, because 1032030311121 - 29 = 1032030310609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1032030311094 and 1032030311103.
It is not an unprimeable number, because it can be changed into a prime (1032030311321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25450651 + ... + 25491168.
Almost surely, 21032030311121 is an apocalyptic number.
It is an amenable number.
1032030311121 is a deficient number, since it is larger than the sum of its proper divisors (459342411199).
1032030311121 is a wasteful number, since it uses less digits than its factorization.
1032030311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50944076 (or 50944073 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1032030311121 its reverse (1211130302301), we get a palindrome (2243160613422).
The spelling of 1032030311121 in words is "one trillion, thirty-two billion, thirty million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •