Base | Representation |
---|---|
bin | 1001101100100101100110… |
… | …1100011100010100000001 |
3 | 1101202020111012001002101010 |
4 | 2123021121230130110001 |
5 | 2344134441043314301 |
6 | 34401513325431133 |
7 | 2150163503524422 |
oct | 233113154342401 |
9 | 41666435032333 |
10 | 10661613651201 |
11 | 3440623a5a707 |
12 | 1242360a0b4a9 |
13 | 5c45029483b6 |
14 | 28c04c2b1649 |
15 | 1374ee00c5d6 |
hex | 9b259b1c501 |
10661613651201 has 16 divisors (see below), whose sum is σ = 14279701936640. Its totient is φ = 7075636001280.
The previous prime is 10661613651173. The next prime is 10661613651233. The reversal of 10661613651201 is 10215631616601.
It is not a de Polignac number, because 10661613651201 - 223 = 10661605262593 is a prime.
It is a super-2 number, since 2×106616136512012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10661613651201.
It is not an unprimeable number, because it can be changed into a prime (10661613651251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21389745 + ... + 21882513.
It is an arithmetic number, because the mean of its divisors is an integer number (892481371040).
Almost surely, 210661613651201 is an apocalyptic number.
It is an amenable number.
10661613651201 is a deficient number, since it is larger than the sum of its proper divisors (3618088285439).
10661613651201 is a wasteful number, since it uses less digits than its factorization.
10661613651201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525336.
The product of its (nonzero) digits is 38880, while the sum is 39.
The spelling of 10661613651201 in words is "ten trillion, six hundred sixty-one billion, six hundred thirteen million, six hundred fifty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •