Base | Representation |
---|---|
bin | 1001100100100011101010… |
… | …1111001001111001110101 |
3 | 1101021001101122002110220221 |
4 | 2121020322233021321311 |
5 | 2334404421230040221 |
6 | 34214300035454341 |
7 | 2134210663155040 |
oct | 231107257117165 |
9 | 41231348073827 |
10 | 10523655315061 |
11 | 339806a08a879 |
12 | 121b67aa573b1 |
13 | 5b44b805a735 |
14 | 2854c1ca5c57 |
15 | 133b2767d541 |
hex | 9923abc9e75 |
10523655315061 has 16 divisors (see below), whose sum is σ = 12093359996800. Its totient is φ = 8970562971648.
The previous prime is 10523655315053. The next prime is 10523655315143. The reversal of 10523655315061 is 16051355632501.
It is a cyclic number.
It is not a de Polignac number, because 10523655315061 - 23 = 10523655315053 is a prime.
It is a super-2 number, since 2×105236553150612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10523655314999 and 10523655315017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10523655315361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2788585 + ... + 5368753.
It is an arithmetic number, because the mean of its divisors is an integer number (755834999800).
Almost surely, 210523655315061 is an apocalyptic number.
It is an amenable number.
10523655315061 is a deficient number, since it is larger than the sum of its proper divisors (1569704681739).
10523655315061 is a wasteful number, since it uses less digits than its factorization.
10523655315061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2583388.
The product of its (nonzero) digits is 405000, while the sum is 43.
The spelling of 10523655315061 in words is "ten trillion, five hundred twenty-three billion, six hundred fifty-five million, three hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •