Base | Representation |
---|---|
bin | 11100000011101111001010… |
… | …011110110001000100110101 |
3 | 121011221010101200201220211022 |
4 | 130003233022132301010311 |
5 | 112133310001211204331 |
6 | 1114242050535150525 |
7 | 34664336064626510 |
oct | 3403571236610465 |
9 | 534833350656738 |
10 | 123402102444341 |
11 | 363575a081a896 |
12 | 11a101a2515445 |
13 | 53b19cb0304c6 |
14 | 226899d44dd77 |
15 | e3ee8a13e67b |
hex | 703bca7b1135 |
123402102444341 has 8 divisors (see below), whose sum is σ = 141248951003520. Its totient is φ = 105609748080528.
The previous prime is 123402102444337. The next prime is 123402102444371. The reversal of 123402102444341 is 143444201204321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123402102444341 - 22 = 123402102444337 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 (123402102444371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13623543986 + ... + 13623553043.
It is an arithmetic number, because the mean of its divisors is an integer number (17656118875440).
Almost surely, 2123402102444341 is an apocalyptic number.
It is an amenable number.
123402102444341 is a deficient number, since it is larger than the sum of its proper divisors (17846848559179).
123402102444341 is an equidigital number, since it uses as much as digits as its factorization.
123402102444341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27247097683.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 123402102444341 its reverse (143444201204321), we get a palindrome (266846303648662).
The spelling of 123402102444341 in words is "one hundred twenty-three trillion, four hundred two billion, one hundred two million, four hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •