Base | Representation |
---|---|
bin | 1001101001010110110100… |
… | …1000001010100001001001 |
3 | 1101112221012200221001122001 |
4 | 2122111231020022201021 |
5 | 2342232300402014401 |
6 | 34320213305031001 |
7 | 2143160112646510 |
oct | 232255510124111 |
9 | 41487180831561 |
10 | 10606105110601 |
11 | 341a02991a570 |
12 | 123364b185461 |
13 | 5bc1c78944c0 |
14 | 2894a4143677 |
15 | 135d50c5c601 |
hex | 9a56d20a849 |
10606105110601 has 16 divisors (see below), whose sum is σ = 14240364905088. Its totient is φ = 7628766912000.
The previous prime is 10606105110533. The next prime is 10606105110611. The reversal of 10606105110601 is 10601150160601.
It is not a de Polignac number, because 10606105110601 - 213 = 10606105102409 is a prime.
It is a super-2 number, since 2×106061051106012 (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 10606105110601.
It is not an unprimeable number, because it can be changed into a prime (10606105110611) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5297753800 + ... + 5297755801.
It is an arithmetic number, because the mean of its divisors is an integer number (890022806568).
Almost surely, 210606105110601 is an apocalyptic number.
10606105110601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10606105110601 is a deficient number, since it is larger than the sum of its proper divisors (3634259794487).
10606105110601 is a wasteful number, since it uses less digits than its factorization.
10606105110601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10595509632.
The product of its (nonzero) digits is 1080, while the sum is 28.
The spelling of 10606105110601 in words is "ten trillion, six hundred six billion, one hundred five million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •