Base | Representation |
---|---|
bin | 1001101010001011000000… |
… | …1100010001110111111111 |
3 | 1101121021101002022112210112 |
4 | 2122202300030101313333 |
5 | 2342444443440232141 |
6 | 34330451421100235 |
7 | 2144164232311265 |
oct | 232426014216777 |
9 | 41537332275715 |
10 | 10620115164671 |
11 | 3424a69165551 |
12 | 12362bb0b767b |
13 | 5c061b2b371c |
14 | 28a032ab6435 |
15 | 1363c0bc97eb |
hex | 9a8b0311dff |
10620115164671 has 4 divisors (see below), whose sum is σ = 10621120963200. Its totient is φ = 10619109366144.
The previous prime is 10620115164649. The next prime is 10620115164679. The reversal of 10620115164671 is 17646151102601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10620115164671 - 226 = 10620048055807 is a prime.
It is a super-2 number, since 2×106201151646712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10620115164679) 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 3 ways as a sum of consecutive naturals, for example, 502883426 + ... + 502904543.
It is an arithmetic number, because the mean of its divisors is an integer number (2655280240800).
Almost surely, 210620115164671 is an apocalyptic number.
10620115164671 is a deficient number, since it is larger than the sum of its proper divisors (1005798529).
10620115164671 is a wasteful number, since it uses less digits than its factorization.
10620115164671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005798528.
The product of its (nonzero) digits is 60480, while the sum is 41.
The spelling of 10620115164671 in words is "ten trillion, six hundred twenty billion, one hundred fifteen million, one hundred sixty-four thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •