Base | Representation |
---|---|
bin | 11111000001100101010… |
… | …010000011111001110101 |
3 | 21112211001221210122210102 |
4 | 133001211102003321311 |
5 | 234412320232342323 |
6 | 4311232331403445 |
7 | 310014010411124 |
oct | 37014522037165 |
9 | 7484057718712 |
10 | 2132003012213 |
11 | 7521a5134708 |
12 | 2a52435b3585 |
13 | 12607c3c9319 |
14 | 75291d99abb |
15 | 3a6d1aeb328 |
hex | 1f065483e75 |
2132003012213 has 8 divisors (see below), whose sum is σ = 2168189150400. Its totient is φ = 2096114702688.
The previous prime is 2132003012189. The next prime is 2132003012219. The reversal of 2132003012213 is 3122103002312.
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 2132003012213 - 210 = 2132003011189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132003012219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74442728 + ... + 74471361.
It is an arithmetic number, because the mean of its divisors is an integer number (271023643800).
Almost surely, 22132003012213 is an apocalyptic number.
It is an amenable number.
2132003012213 is a deficient number, since it is larger than the sum of its proper divisors (36186138187).
2132003012213 is a wasteful number, since it uses less digits than its factorization.
2132003012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148914331.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2132003012213 its reverse (3122103002312), we get a palindrome (5254106014525).
Subtracting 2132003012213 from its reverse (3122103002312), we obtain a palindrome (990099990099).
The spelling of 2132003012213 in words is "two trillion, one hundred thirty-two billion, three million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •