Base | Representation |
---|---|
bin | 1001101001010110011100… |
… | …1010111011010000001101 |
3 | 1101112220221201212121120020 |
4 | 2122111213022323100031 |
5 | 2342232044310434323 |
6 | 34320155335012353 |
7 | 2143154460326154 |
oct | 232254712732015 |
9 | 41486851777506 |
10 | 10606005171213 |
11 | 3419a8846a631 |
12 | 123362180a0b9 |
13 | 5bc1acc7247a |
14 | 289494b6a59b |
15 | 135d470baae3 |
hex | 9a5672bb40d |
10606005171213 has 8 divisors (see below), whose sum is σ = 14373165478176. Its totient is φ = 6954757489200.
The previous prime is 10606005171187. The next prime is 10606005171233. The reversal of 10606005171213 is 31217150060601.
10606005171213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10606005171213 - 213 = 10606005163021 is a prime.
It is a super-2 number, since 2×106060051712132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10606005171233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28978156023 + ... + 28978156388.
It is an arithmetic number, because the mean of its divisors is an integer number (1796645684772).
Almost surely, 210606005171213 is an apocalyptic number.
It is an amenable number.
10606005171213 is a deficient number, since it is larger than the sum of its proper divisors (3767160306963).
10606005171213 is an equidigital number, since it uses as much as digits as its factorization.
10606005171213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57956312475.
The product of its (nonzero) digits is 7560, while the sum is 33.
The spelling of 10606005171213 in words is "ten trillion, six hundred six billion, five million, one hundred seventy-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •