Base | Representation |
---|---|
bin | 111001010001111111… |
… | …0110000000010101011 |
3 | 102202111210102122022121 |
4 | 1302203332300002223 |
5 | 4003411104021303 |
6 | 132302103532111 |
7 | 11613210422413 |
oct | 1624376600253 |
9 | 382453378277 |
10 | 123010220203 |
11 | 48194076112 |
12 | 1ba0ba5a037 |
13 | b7a4a39760 |
14 | 5d4d04d643 |
15 | 32ee3b79bd |
hex | 1ca3fb00ab |
123010220203 has 16 divisors (see below), whose sum is σ = 135957328416. Its totient is φ = 110592218880.
The previous prime is 123010220183. The next prime is 123010220209. The reversal of 123010220203 is 302022010321.
It is a de Polignac number, because none of the positive numbers 2k-123010220203 is a prime.
It is a super-3 number, since 3×1230102202033 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (123010220209) 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 15 ways as a sum of consecutive naturals, for example, 557193 + ... + 745978.
It is an arithmetic number, because the mean of its divisors is an integer number (8497333026).
Almost surely, 2123010220203 is an apocalyptic number.
123010220203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
123010220203 is a deficient number, since it is larger than the sum of its proper divisors (12947108213).
123010220203 is a wasteful number, since it uses less digits than its factorization.
123010220203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1303374.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 123010220203 its reverse (302022010321), we get a palindrome (425032230524).
The spelling of 123010220203 in words is "one hundred twenty-three billion, ten million, two hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •