Base | Representation |
---|---|
bin | 11100000010011011100010… |
… | …000001001011111101010111 |
3 | 121011121112121102022000122021 |
4 | 130002123202001023331113 |
5 | 112130322044033430403 |
6 | 1114132520122114011 |
7 | 34655006552330215 |
oct | 3402334201137527 |
9 | 534545542260567 |
10 | 123312303030103 |
11 | 363224aa351860 |
12 | 119b690094b907 |
13 | 53a63b993c035 |
14 | 22644c1047cb5 |
15 | e3c9816d58bd |
hex | 7026e204bf57 |
123312303030103 has 32 divisors (see below), whose sum is σ = 135821734041600. Its totient is φ = 111025682056800.
The previous prime is 123312303030089. The next prime is 123312303030143. The reversal of 123312303030103 is 301030303213321.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123312303030103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123312303030143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 485279958 + ... + 485533996.
It is an arithmetic number, because the mean of its divisors is an integer number (4244429188800).
Almost surely, 2123312303030103 is an apocalyptic number.
123312303030103 is a deficient number, since it is larger than the sum of its proper divisors (12509431011497).
123312303030103 is a wasteful number, since it uses less digits than its factorization.
123312303030103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255283.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 123312303030103 its reverse (301030303213321), we get a palindrome (424342606243424).
The spelling of 123312303030103 in words is "one hundred twenty-three trillion, three hundred twelve billion, three hundred three million, thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •