Base | Representation |
---|---|
bin | 100000000011110100111… |
… | …010000101100010100101 |
3 | 21210121200001202212220012 |
4 | 200003310322011202211 |
5 | 242044003310421201 |
6 | 4404034355220005 |
7 | 315112445030624 |
oct | 40036472054245 |
9 | 7717601685805 |
10 | 2203132123301 |
11 | 77a38571463a |
12 | 2b6b945a7605 |
13 | 12c9a6747b35 |
14 | 788bc92b6bb |
15 | 3c4963e35bb |
hex | 200f4e858a5 |
2203132123301 has 32 divisors (see below), whose sum is σ = 2644918272000. Its totient is φ = 1818380931840.
The previous prime is 2203132123289. The next prime is 2203132123303. The reversal of 2203132123301 is 1033212313022.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2203132123301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2203132123303) 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 31 ways as a sum of consecutive naturals, for example, 4552901 + ... + 5013498.
It is an arithmetic number, because the mean of its divisors is an integer number (82653696000).
Almost surely, 22203132123301 is an apocalyptic number.
It is an amenable number.
2203132123301 is a deficient number, since it is larger than the sum of its proper divisors (441786148699).
2203132123301 is a wasteful number, since it uses less digits than its factorization.
2203132123301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9566489.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2203132123301 its reverse (1033212313022), we get a palindrome (3236344436323).
The spelling of 2203132123301 in words is "two trillion, two hundred three billion, one hundred thirty-two million, one hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •