Base | Representation |
---|---|
bin | 1001000111101000001100… |
… | …0100001101010001110001 |
3 | 1022111112112122202221222201 |
4 | 2101322003010031101301 |
5 | 2303234041030241441 |
6 | 33154103002303201 |
7 | 2053254540530032 |
oct | 221720304152161 |
9 | 38445478687881 |
10 | 10026652587121 |
11 | 3216308a9a225 |
12 | 115b2957b7b01 |
13 | 579680b7a631 |
14 | 269414b78a89 |
15 | 125c39c50c31 |
hex | 91e8310d471 |
10026652587121 has 9 divisors (see below), whose sum is σ = 10048005191233. Its totient is φ = 10005345282640.
The previous prime is 10026652587089. The next prime is 10026652587167. The reversal of 10026652587121 is 12178525662001.
The square root of 10026652587121 is 3166489.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 610837596721 + 9415814990400 = 781561^2 + 3068520^2 .
It is not a de Polignac number, because 10026652587121 - 25 = 10026652587089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10026652587181) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1611739791 + ... + 1611746011.
Almost surely, 210026652587121 is an apocalyptic number.
10026652587121 is the 3166489-th square number.
10026652587121 is the 1583245-th centered octagonal number.
It is an amenable number.
10026652587121 is a deficient number, since it is larger than the sum of its proper divisors (21352604112).
10026652587121 is an frugal number, since it uses more digits than its factorization.
10026652587121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13460 (or 6730 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 46.
The spelling of 10026652587121 in words is "ten trillion, twenty-six billion, six hundred fifty-two million, five hundred eighty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •