Base | Representation |
---|---|
bin | 11110000010010000001… |
… | …00010010000011100001 |
3 | 10122122202221101111121101 |
4 | 33001020010102003201 |
5 | 113402014303424441 |
6 | 2110032251554401 |
7 | 134362644513535 |
oct | 17011004220341 |
9 | 3578687344541 |
10 | 1032001233121 |
11 | 36873a878aa1 |
12 | 14801315ba01 |
13 | 7641814a341 |
14 | 37d4058bbc5 |
15 | 1bca0de8231 |
hex | f0481120e1 |
1032001233121 has 4 divisors (see below), whose sum is σ = 1032284520112. Its totient is φ = 1031717946132.
The previous prime is 1032001233119. The next prime is 1032001233127. The reversal of 1032001233121 is 1213321002301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1032001233121 - 21 = 1032001233119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032001233127) 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, 141638031 + ... + 141645316.
It is an arithmetic number, because the mean of its divisors is an integer number (258071130028).
Almost surely, 21032001233121 is an apocalyptic number.
It is an amenable number.
1032001233121 is a deficient number, since it is larger than the sum of its proper divisors (283286991).
1032001233121 is an equidigital number, since it uses as much as digits as its factorization.
1032001233121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283286990.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1032001233121 its reverse (1213321002301), we get a palindrome (2245322235422).
The spelling of 1032001233121 in words is "one trillion, thirty-two billion, one million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •