Base | Representation |
---|---|
bin | 1001101001000010010101… |
… | …0101000000100110011001 |
3 | 1101112102000102112111010110 |
4 | 2122100211111000212121 |
5 | 2342140020010113001 |
6 | 34313503450234533 |
7 | 2142603613321164 |
oct | 232204525004631 |
9 | 41472012474113 |
10 | 10600605551001 |
11 | 3417767526a94 |
12 | 1232575425a49 |
13 | 5bb82c3a611b |
14 | 2891019a2adb |
15 | 135b2d0283d6 |
hex | 9a425540999 |
10600605551001 has 32 divisors (see below), whose sum is σ = 14229190080000. Its totient is φ = 7019720352000.
The previous prime is 10600605550981. The next prime is 10600605551071. The reversal of 10600605551001 is 10015550600601.
It is not a de Polignac number, because 10600605551001 - 29 = 10600605550489 is a prime.
It is a super-2 number, since 2×106006055510012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10600605551001.
It is not an unprimeable number, because it can be changed into a prime (10600605551071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 559477810 + ... + 559496756.
It is an arithmetic number, because the mean of its divisors is an integer number (444662190000).
Almost surely, 210600605551001 is an apocalyptic number.
It is an amenable number.
10600605551001 is a deficient number, since it is larger than the sum of its proper divisors (3628584528999).
10600605551001 is a wasteful number, since it uses less digits than its factorization.
10600605551001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21189.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 10600605551001 in words is "ten trillion, six hundred billion, six hundred five million, five hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •