Base | Representation |
---|---|
bin | 11101100100111011110… |
… | …101100111000001010101 |
3 | 21012022022001102210112211 |
4 | 131210323311213001111 |
5 | 231300102000041323 |
6 | 4153421155113421 |
7 | 266562553120330 |
oct | 35447365470125 |
9 | 7168261383484 |
10 | 2032523440213 |
11 | 713a965488a2 |
12 | 289abbba2871 |
13 | 119887674b56 |
14 | 705360cb617 |
15 | 37d0d41270d |
hex | 1d93bd67055 |
2032523440213 has 8 divisors (see below), whose sum is σ = 2372306994432. Its totient is φ = 1705095651696.
The previous prime is 2032523440151. The next prime is 2032523440223. The reversal of 2032523440213 is 3120443252302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2032523440213 - 213 = 2032523432021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2032523440223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3088941070 + ... + 3088941727.
It is an arithmetic number, because the mean of its divisors is an integer number (296538374304).
Almost surely, 22032523440213 is an apocalyptic number.
It is an amenable number.
2032523440213 is a deficient number, since it is larger than the sum of its proper divisors (339783554219).
2032523440213 is an equidigital number, since it uses as much as digits as its factorization.
2032523440213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6177882851.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 2032523440213 its reverse (3120443252302), we get a palindrome (5152966692515).
The spelling of 2032523440213 in words is "two trillion, thirty-two billion, five hundred twenty-three million, four hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •