Base | Representation |
---|---|
bin | 1001101001000101101110… |
… | …1000011000101011110011 |
3 | 1101112111100220211120110212 |
4 | 2122101123220120223303 |
5 | 2342143401222200201 |
6 | 34314134113214335 |
7 | 2142635315155646 |
oct | 232213350305363 |
9 | 41474326746425 |
10 | 10601516600051 |
11 | 3418094815693 |
12 | 123278a5613ab |
13 | 5bb94606a9c0 |
14 | 28918a997a5d |
15 | 135b82ed8abb |
hex | 9a45ba18af3 |
10601516600051 has 16 divisors (see below), whose sum is σ = 11804785358688. Its totient is φ = 9458104569600.
The previous prime is 10601516600047. The next prime is 10601516600089. The reversal of 10601516600051 is 15000661510601.
10601516600051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10601516600051 - 22 = 10601516600047 is a prime.
It is a super-2 number, since 2×106015166000512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10601516599990 and 10601516600017.
It is not an unprimeable number, because it can be changed into a prime (10601516600951) 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, 92888180 + ... + 93002241.
It is an arithmetic number, because the mean of its divisors is an integer number (737799084918).
Almost surely, 210601516600051 is an apocalyptic number.
10601516600051 is a deficient number, since it is larger than the sum of its proper divisors (1203268758637).
10601516600051 is a wasteful number, since it uses less digits than its factorization.
10601516600051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185890582.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 10601516600051 in words is "ten trillion, six hundred one billion, five hundred sixteen million, six hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •