Base | Representation |
---|---|
bin | 11011111111110101100110… |
… | …111000010000001000100101 |
3 | 121010222111202011120200002101 |
4 | 123333311212320100020211 |
5 | 112114412211204244310 |
6 | 1113515013343412101 |
7 | 34636101601613044 |
oct | 3377654670201045 |
9 | 533874664520071 |
10 | 123134143431205 |
11 | 36263995959225 |
12 | 1198827b5b4031 |
13 | 5392666391b2a |
14 | 2259a1d84055b |
15 | e3800586643a |
hex | 6ffd66e10225 |
123134143431205 has 32 divisors (see below), whose sum is σ = 155561535940608. Its totient is φ = 93443697446400.
The previous prime is 123134143431157. The next prime is 123134143431209. The reversal of 123134143431205 is 502134341431321.
It is a de Polignac number, because none of the positive numbers 2k-123134143431205 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123134143431209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5639554 + ... + 16675516.
It is an arithmetic number, because the mean of its divisors is an integer number (4861297998144).
Almost surely, 2123134143431205 is an apocalyptic number.
It is an amenable number.
123134143431205 is a deficient number, since it is larger than the sum of its proper divisors (32427392509403).
123134143431205 is a wasteful number, since it uses less digits than its factorization.
123134143431205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11037517.
The product of its (nonzero) digits is 103680, while the sum is 37.
Adding to 123134143431205 its reverse (502134341431321), we get a palindrome (625268484862526).
The spelling of 123134143431205 in words is "one hundred twenty-three trillion, one hundred thirty-four billion, one hundred forty-three million, four hundred thirty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •