Base | Representation |
---|---|
bin | 11011111110000110000010… |
… | …111001111011110101111101 |
3 | 121010120001112212200000022210 |
4 | 123332012002321323311331 |
5 | 112110431344231101031 |
6 | 1113344003032131033 |
7 | 34624331245124535 |
oct | 3376060271736575 |
9 | 533501485600283 |
10 | 123014354550141 |
11 | 3621810519096a |
12 | 1196900a536a79 |
13 | 5384285b55a12 |
14 | 2253cd85724c5 |
15 | e34d441b4746 |
hex | 6fe182e7bd7d |
123014354550141 has 8 divisors (see below), whose sum is σ = 164275019495424. Its totient is φ = 81881629652480.
The previous prime is 123014354550127. The next prime is 123014354550151. The reversal of 123014354550141 is 141055453410321.
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 123014354550141 - 217 = 123014354419069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123014354550141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123014354550151) 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, 31985009661 + ... + 31985013506.
It is an arithmetic number, because the mean of its divisors is an integer number (20534377436928).
Almost surely, 2123014354550141 is an apocalyptic number.
It is an amenable number.
123014354550141 is a deficient number, since it is larger than the sum of its proper divisors (41260664945283).
123014354550141 is an equidigital number, since it uses as much as digits as its factorization.
123014354550141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63970023811.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 123014354550141 in words is "one hundred twenty-three trillion, fourteen billion, three hundred fifty-four million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •