Base | Representation |
---|---|
bin | 11110000100001001110… |
… | …10001101001111010011 |
3 | 10122202102002010221110000 |
4 | 33002010322031033103 |
5 | 113411112113032011 |
6 | 2110321434341043 |
7 | 134430151065510 |
oct | 17020472151723 |
9 | 3582362127400 |
10 | 1033022002131 |
11 | 369113a97949 |
12 | 148258b8a783 |
13 | 7654b779982 |
14 | 37dd9d84307 |
15 | 1bd1082d356 |
hex | f084e8d3d3 |
1033022002131 has 20 divisors (see below), whose sum is σ = 1763607228592. Its totient is φ = 590298286608.
The previous prime is 1033022002097. The next prime is 1033022002141. The reversal of 1033022002131 is 1312002203301.
1033022002131 is a `hidden beast` number, since 1 + 0 + 330 + 2 + 200 + 2 + 131 = 666.
1033022002131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1033022002131 - 211 = 1033022000083 is a prime.
It is a super-2 number, since 2×10330220021312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1033022002141) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 910953580 + ... + 910954713.
Almost surely, 21033022002131 is an apocalyptic number.
1033022002131 is a deficient number, since it is larger than the sum of its proper divisors (730585226461).
1033022002131 is an equidigital number, since it uses as much as digits as its factorization.
1033022002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1821908312 (or 1821908303 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1033022002131 its reverse (1312002203301), we get a palindrome (2345024205432).
The spelling of 1033022002131 in words is "one trillion, thirty-three billion, twenty-two million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •