Base | Representation |
---|---|
bin | 11100000001100110011110… |
… | …010011101010111101011110 |
3 | 121011102002120001002200221020 |
4 | 130001212132103222331132 |
5 | 112123403410101401032 |
6 | 1114050415032545010 |
7 | 34650622016360004 |
oct | 3401463623527536 |
9 | 534362501080836 |
10 | 123255332450142 |
11 | 363003249a9922 |
12 | 119a7861552166 |
13 | 53a0c0a9c73a9 |
14 | 2261838a58a74 |
15 | e3b249dd8b2c |
hex | 70199e4eaf5e |
123255332450142 has 8 divisors (see below), whose sum is σ = 246510664900296. Its totient is φ = 41085110816712.
The previous prime is 123255332450141. The next prime is 123255332450147. The reversal of 123255332450142 is 241054233552321.
It is a sphenic number, since it is the product of 3 distinct primes.
123255332450142 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 123255332450094 and 123255332450103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123255332450141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10271277704173 + ... + 10271277704184.
It is an arithmetic number, because the mean of its divisors is an integer number (30813833112537).
Almost surely, 2123255332450142 is an apocalyptic number.
123255332450142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123255332450142 is a wasteful number, since it uses less digits than its factorization.
123255332450142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20542555408362.
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 123255332450142 in words is "one hundred twenty-three trillion, two hundred fifty-five billion, three hundred thirty-two million, four hundred fifty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •