Base | Representation |
---|---|
bin | 1001010101010111001101… |
… | …0001100111011011111001 |
3 | 1100100002120222220120121101 |
4 | 2111111303101213123321 |
5 | 2321120311340233321 |
6 | 33454324531211401 |
7 | 2106310031033044 |
oct | 225256321473371 |
9 | 40302528816541 |
10 | 10262610867961 |
11 | 32a739231aaa1 |
12 | 1198b67746b61 |
13 | 5959b5ab145a |
14 | 2769da733c5b |
15 | 12be49e45791 |
hex | 955734676f9 |
10262610867961 has 9 divisors (see below), whose sum is σ = 10901862476751. Its totient is φ = 9658876619232.
The previous prime is 10262610867959. The next prime is 10262610867997. The reversal of 10262610867961 is 16976801626201.
The square root of 10262610867961 is 3203531.
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., 7989921956025 + 2272688911936 = 2826645^2 + 1507544^2 .
It is not a de Polignac number, because 10262610867961 - 21 = 10262610867959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10262610867931) 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, 54365806 + ... + 54554248.
Almost surely, 210262610867961 is an apocalyptic number.
10262610867961 is the 3203531-st square number.
10262610867961 is the 1601766-th centered octagonal number.
It is an amenable number.
10262610867961 is a deficient number, since it is larger than the sum of its proper divisors (639251608790).
10262610867961 is an frugal number, since it uses more digits than its factorization.
10262610867961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376920 (or 188460 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 55.
The spelling of 10262610867961 in words is "ten trillion, two hundred sixty-two billion, six hundred ten million, eight hundred sixty-seven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •