Base | Representation |
---|---|
bin | 11011111110101011001010… |
… | …011111100110101101010010 |
3 | 121010200212102111022112201111 |
4 | 123332223022133212231102 |
5 | 112112110010320004132 |
6 | 1113414153535323534 |
7 | 34630242021410161 |
oct | 3376531237465522 |
9 | 533625374275644 |
10 | 123054210313042 |
11 | 36232aa7783498 |
12 | 119748920805aa |
13 | 5387c68076488 |
14 | 2255bd99153d8 |
15 | e35dc81a9647 |
hex | 6feaca7e6b52 |
123054210313042 has 8 divisors (see below), whose sum is σ = 184582503542016. Its totient is φ = 61526709132372.
The previous prime is 123054210312997. The next prime is 123054210313057. The reversal of 123054210313042 is 240313012450321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1230542103130422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123054210312995 and 123054210313013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 197623518 + ... + 198245209.
It is an arithmetic number, because the mean of its divisors is an integer number (23072812942752).
Almost surely, 2123054210313042 is an apocalyptic number.
123054210313042 is a deficient number, since it is larger than the sum of its proper divisors (61528293228974).
123054210313042 is a wasteful number, since it uses less digits than its factorization.
123054210313042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396024152.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 123054210313042 its reverse (240313012450321), we get a palindrome (363367222763363).
The spelling of 123054210313042 in words is "one hundred twenty-three trillion, fifty-four billion, two hundred ten million, three hundred thirteen thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •