Base | Representation |
---|---|
bin | 1001101001000000010011… |
… | …0011111001011101100101 |
3 | 1101112100121101222121222120 |
4 | 2122100010303321131211 |
5 | 2342132410330000401 |
6 | 34313333401220153 |
7 | 2142554240236605 |
oct | 232200463713545 |
9 | 41470541877876 |
10 | 10600060000101 |
11 | 3417507588580 |
12 | 1232442791659 |
13 | 5bb773362a40 |
14 | 28908d350c05 |
15 | 135aea1b3836 |
hex | 9a404cf9765 |
10600060000101 has 32 divisors (see below), whose sum is σ = 16604650043520. Its totient is φ = 5929974835200.
The previous prime is 10600060000099. The next prime is 10600060000109. The reversal of 10600060000101 is 10100006000601.
It is not a de Polignac number, because 10600060000101 - 21 = 10600060000099 is a prime.
It is a super-2 number, since 2×106000600001012 (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 (10600060000109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21605961 + ... + 22091121.
It is an arithmetic number, because the mean of its divisors is an integer number (518895313860).
Almost surely, 210600060000101 is an apocalyptic number.
10600060000101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10600060000101 is a deficient number, since it is larger than the sum of its proper divisors (6004590043419).
10600060000101 is a wasteful number, since it uses less digits than its factorization.
10600060000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536117.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10600060000101 its reverse (10100006000601), we get a palindrome (20700066000702).
The spelling of 10600060000101 in words is "ten trillion, six hundred billion, sixty million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •