Base | Representation |
---|---|
bin | 111001101100011001… |
… | …0101101011001111001 |
3 | 102211210112122221002201 |
4 | 1303120302231121321 |
5 | 4012214420143441 |
6 | 132530034430201 |
7 | 11644156541461 |
oct | 1633062553171 |
9 | 384715587081 |
10 | 123896256121 |
11 | 485a9230000 |
12 | 20018732361 |
13 | b8b6484171 |
14 | 5dd49b2ba1 |
15 | 3352086c31 |
hex | 1cd8cad679 |
123896256121 has 15 divisors (see below), whose sum is σ = 136331901055. Its totient is φ = 112594241320.
The previous prime is 123896256101. The next prime is 123896256163. The reversal of 123896256121 is 121652698321.
The square root of 123896256121 is 351989.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 107445628521 + 16450627600 = 327789^2 + 128260^2 .
It is not a de Polignac number, because 123896256121 - 27 = 123896255993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123896256101) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 42589215 + ... + 42592123.
Almost surely, 2123896256121 is an apocalyptic number.
123896256121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123896256121 is the 351989-th square number.
123896256121 is the 175995-th centered octagonal number.
It is an amenable number.
123896256121 is a deficient number, since it is larger than the sum of its proper divisors (12435644934).
123896256121 is an frugal number, since it uses more digits than its factorization.
123896256121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5862 (or 2920 counting only the distinct ones).
The product of its digits is 311040, while the sum is 46.
The spelling of 123896256121 in words is "one hundred twenty-three billion, eight hundred ninety-six million, two hundred fifty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •