Base | Representation |
---|---|
bin | 111001010101000011… |
… | …1010010100111111101 |
3 | 102202202222001121110102 |
4 | 1302222013102213331 |
5 | 4004113424403201 |
6 | 132320221250445 |
7 | 11615600162501 |
oct | 1625207224775 |
9 | 382688047412 |
10 | 123113122301 |
11 | 48237169a74 |
12 | 1ba3a403a25 |
13 | b7c0158180 |
14 | 5d5c998301 |
15 | 330844226b |
hex | 1caa1d29fd |
123113122301 has 8 divisors (see below), whose sum is σ = 134073064440. Its totient is φ = 112365994752.
The previous prime is 123113122289. The next prime is 123113122331. The reversal of 123113122301 is 103221311321.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8005596676 + 115107525625 = 89474^2 + 339275^2 .
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 123113122301 - 226 = 123046013437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123113122331) 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, 53202440 + ... + 53204753.
It is an arithmetic number, because the mean of its divisors is an integer number (16759133055).
Almost surely, 2123113122301 is an apocalyptic number.
It is an amenable number.
123113122301 is a deficient number, since it is larger than the sum of its proper divisors (10959942139).
123113122301 is a wasteful number, since it uses less digits than its factorization.
123113122301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106407295.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 123113122301 its reverse (103221311321), we get a palindrome (226334433622).
The spelling of 123113122301 in words is "one hundred twenty-three billion, one hundred thirteen million, one hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •