Base | Representation |
---|---|
bin | 1001010101001101110000… |
… | …1110011000110110111001 |
3 | 1100022212001101100120211210 |
4 | 2111103130032120312321 |
5 | 2321100114111142301 |
6 | 33453225242313333 |
7 | 2106160156451052 |
oct | 225233416306671 |
9 | 40285041316753 |
10 | 10260076662201 |
11 | 32a6301883773 |
12 | 119857aab8849 |
13 | 5956a0a66912 |
14 | 276839d3b729 |
15 | 12bd4c70ead6 |
hex | 954dc398db9 |
10260076662201 has 32 divisors (see below), whose sum is σ = 14071071530880. Its totient is φ = 6647322240000.
The previous prime is 10260076662193. The next prime is 10260076662211. The reversal of 10260076662201 is 10226667006201.
It is not a de Polignac number, because 10260076662201 - 23 = 10260076662193 is a prime.
It is a super-2 number, since 2×102600766622012 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10260076662201.
It is not an unprimeable number, because it can be changed into a prime (10260076662211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6513345 + ... + 7933713.
It is an arithmetic number, because the mean of its divisors is an integer number (439720985340).
Almost surely, 210260076662201 is an apocalyptic number.
It is an amenable number.
10260076662201 is a deficient number, since it is larger than the sum of its proper divisors (3810994868679).
10260076662201 is a wasteful number, since it uses less digits than its factorization.
10260076662201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1420857.
The product of its (nonzero) digits is 72576, while the sum is 39.
The spelling of 10260076662201 in words is "ten trillion, two hundred sixty billion, seventy-six million, six hundred sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •