Base | Representation |
---|---|
bin | 11101100100011110100… |
… | …000010111101100000001 |
3 | 21012021000202110011112020 |
4 | 131210132200113230001 |
5 | 231243100010124441 |
6 | 4153300255352053 |
7 | 266544426225636 |
oct | 35443640275401 |
9 | 7167022404466 |
10 | 2032031333121 |
11 | 713863792519 |
12 | 2899a3222629 |
13 | 11980972451a |
14 | 704ca9cc18d |
15 | 37cd0107e66 |
hex | 1d91e817b01 |
2032031333121 has 8 divisors (see below), whose sum is σ = 2709547405344. Its totient is φ = 1354601408160.
The previous prime is 2032031333093. The next prime is 2032031333179. The reversal of 2032031333121 is 1213331302302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2032031333121 - 29 = 2032031332609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2032031333091 and 2032031333100.
It is not an unprimeable number, because it can be changed into a prime (2032031333021) 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 7 ways as a sum of consecutive naturals, for example, 21481756 + ... + 21576141.
It is an arithmetic number, because the mean of its divisors is an integer number (338693425668).
Almost surely, 22032031333121 is an apocalyptic number.
It is an amenable number.
2032031333121 is a deficient number, since it is larger than the sum of its proper divisors (677516072223).
2032031333121 is a wasteful number, since it uses less digits than its factorization.
2032031333121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43073631.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 2032031333121 its reverse (1213331302302), we get a palindrome (3245362635423).
The spelling of 2032031333121 in words is "two trillion, thirty-two billion, thirty-one million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •