Base | Representation |
---|---|
bin | 11011111111011000111011… |
… | …011110001101101100101101 |
3 | 121010212120021011002022210022 |
4 | 123333120323132031230231 |
5 | 112113411130201223000 |
6 | 1113452522022251525 |
7 | 34633631532363044 |
oct | 3377307336155455 |
9 | 533776234068708 |
10 | 123103350414125 |
11 | 36251924013784 |
12 | 11982306b86ba5 |
13 | 538c799920373 |
14 | 225833bd6755b |
15 | e373022e4585 |
hex | 6ff63b78db2d |
123103350414125 has 16 divisors (see below), whose sum is σ = 154412844197040. Its totient is φ = 97982768228800.
The previous prime is 123103350414091. The next prime is 123103350414137. The reversal of 123103350414125 is 521414053301321.
It can be written as a sum of positive squares in 8 ways, for example, as 1003038304324 + 122100312109801 = 1001518^2 + 11049901^2 .
It is not a de Polignac number, because 123103350414125 - 210 = 123103350413101 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2499535790 + ... + 2499585039.
It is an arithmetic number, because the mean of its divisors is an integer number (9650802762315).
Almost surely, 2123103350414125 is an apocalyptic number.
It is an amenable number.
123103350414125 is a deficient number, since it is larger than the sum of its proper divisors (31309493782915).
123103350414125 is an equidigital number, since it uses as much as digits as its factorization.
123103350414125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4999121041 (or 4999121031 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 123103350414125 in words is "one hundred twenty-three trillion, one hundred three billion, three hundred fifty million, four hundred fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •