Base | Representation |
---|---|
bin | 11011111111010110000101… |
… | …101001110110111010010011 |
3 | 121010212021101120012220101101 |
4 | 123333112011221312322103 |
5 | 112113333403300410303 |
6 | 1113451255213445231 |
7 | 34633463122402642 |
oct | 3377260551667223 |
9 | 533767346186341 |
10 | 123100300013203 |
11 | 362505a9159387 |
12 | 119817b54a0817 |
13 | 538c4019700c6 |
14 | 225812cba1359 |
15 | e371c45e6d1d |
hex | 6ff585a76e93 |
123100300013203 has 4 divisors (see below), whose sum is σ = 123100685145400. Its totient is φ = 123099914881008.
The previous prime is 123100300013183. The next prime is 123100300013221. The reversal of 123100300013203 is 302310003001321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123100300013203 - 29 = 123100300012691 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123100306013203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 192086253 + ... + 192726046.
It is an arithmetic number, because the mean of its divisors is an integer number (30775171286350).
Almost surely, 2123100300013203 is an apocalyptic number.
123100300013203 is a deficient number, since it is larger than the sum of its proper divisors (385132197).
123100300013203 is an equidigital number, since it uses as much as digits as its factorization.
123100300013203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385132196.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 123100300013203 its reverse (302310003001321), we get a palindrome (425410303014524).
The spelling of 123100300013203 in words is "one hundred twenty-three trillion, one hundred billion, three hundred million, thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •