Base | Representation |
---|---|
bin | 111001010010010111… |
… | …1111101011010010110 |
3 | 102202112200201000112200 |
4 | 1302210233331122112 |
5 | 4003422404320042 |
6 | 132303244225330 |
7 | 11613425160255 |
oct | 1624457753226 |
9 | 382480630480 |
10 | 123023120022 |
11 | 481a0386a20 |
12 | 1ba1423b246 |
13 | b7a760519a |
14 | 5d50a4a79c |
15 | 33005b4c4c |
hex | 1ca4bfd696 |
123023120022 has 24 divisors (see below), whose sum is σ = 290781920520. Its totient is φ = 37279733280.
The previous prime is 123023120021. The next prime is 123023120027. The reversal of 123023120022 is 220021320321.
123023120022 is a `hidden beast` number, since 1 + 230 + 231 + 200 + 2 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 123023119977 and 123023120004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123023120021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 310664247 + ... + 310664642.
It is an arithmetic number, because the mean of its divisors is an integer number (12115913355).
Almost surely, 2123023120022 is an apocalyptic number.
123023120022 is an abundant number, since it is smaller than the sum of its proper divisors (167758800498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123023120022 is a wasteful number, since it uses less digits than its factorization.
123023120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 621328908 (or 621328905 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 123023120022 its reverse (220021320321), we get a palindrome (343044440343).
The spelling of 123023120022 in words is "one hundred twenty-three billion, twenty-three million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •