Base | Representation |
---|---|
bin | 111100100011110… |
… | …0000011111001101 |
3 | 12020121120212100120 |
4 | 1321013200133031 |
5 | 13130143324323 |
6 | 533345015153 |
7 | 101232544641 |
oct | 17107403715 |
9 | 5217525316 |
10 | 2032011213 |
11 | 953021111 |
12 | 4886244b9 |
13 | 264ca48cb |
14 | 153c2cc21 |
15 | bd5d75e3 |
hex | 791e07cd |
2032011213 has 8 divisors (see below), whose sum is σ = 2734669728. Its totient is φ = 1342013424.
The previous prime is 2032011187. The next prime is 2032011253. The reversal of 2032011213 is 3121102302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2032011213 - 25 = 2032011181 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2032011192 and 2032011201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2032011253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3164806 + ... + 3165447.
It is an arithmetic number, because the mean of its divisors is an integer number (341833716).
Almost surely, 22032011213 is an apocalyptic number.
It is an amenable number.
2032011213 is a deficient number, since it is larger than the sum of its proper divisors (702658515).
2032011213 is a wasteful number, since it uses less digits than its factorization.
2032011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6330363.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2032011213 is about 45077.8350522738. The cubic root of 2032011213 is about 1266.6074360654.
Adding to 2032011213 its reverse (3121102302), we get a palindrome (5153113515).
The spelling of 2032011213 in words is "two billion, thirty-two million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •