Base | Representation |
---|---|
bin | 1011010111110010001000… |
… | …0000010101100010001011 |
3 | 1122021021222220212121220022 |
4 | 2311330202000111202023 |
5 | 3114323043344442303 |
6 | 42331522231451055 |
7 | 2430220312051235 |
oct | 265744200254213 |
9 | 48237886777808 |
10 | 12503220312203 |
11 | 3a906499a9545 |
12 | 149b25b226a8b |
13 | 6c9082a6b72a |
14 | 313232797255 |
15 | 16a386615438 |
hex | b5f2201588b |
12503220312203 has 8 divisors (see below), whose sum is σ = 13013717782800. Its totient is φ = 11998012971168.
The previous prime is 12503220312197. The next prime is 12503220312227. The reversal of 12503220312203 is 30221302230521.
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 12503220312203 - 28 = 12503220311947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12503220312103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1322527568 + ... + 1322537021.
It is an arithmetic number, because the mean of its divisors is an integer number (1626714722850).
Almost surely, 212503220312203 is an apocalyptic number.
12503220312203 is a deficient number, since it is larger than the sum of its proper divisors (510497470597).
12503220312203 is a wasteful number, since it uses less digits than its factorization.
12503220312203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2645064781.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 12503220312203 its reverse (30221302230521), we get a palindrome (42724522542724).
The spelling of 12503220312203 in words is "twelve trillion, five hundred three billion, two hundred twenty million, three hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •