Base | Representation |
---|---|
bin | 1001101001000010010011… |
… | …1111110101011001000001 |
3 | 1101112102000001002110200020 |
4 | 2122100210333311121001 |
5 | 2342140012100000230 |
6 | 34313503131244053 |
7 | 2142603515201535 |
oct | 232204477653101 |
9 | 41472001073606 |
10 | 10600600000065 |
11 | 3417764385539 |
12 | 12325735a9629 |
13 | 5bb82b1b164a |
14 | 289100d59bc5 |
15 | 135b2c7cd810 |
hex | 9a424ff5641 |
10600600000065 has 16 divisors (see below), whose sum is σ = 16961150072448. Its totient is φ = 5653589975936.
The previous prime is 10600600000037. The next prime is 10600600000139. The reversal of 10600600000065 is 56000000600601.
It is a cyclic number.
It is not a de Polignac number, because 10600600000065 - 29 = 10600599999553 is a prime.
It is a super-2 number, since 2×106006000000652 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10600599999990 and 10600600000044.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2560764 + ... + 5268653.
It is an arithmetic number, because the mean of its divisors is an integer number (1060071879528).
Almost surely, 210600600000065 is an apocalyptic number.
10600600000065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10600600000065 is a deficient number, since it is larger than the sum of its proper divisors (6360550072383).
10600600000065 is an equidigital number, since it uses as much as digits as its factorization.
10600600000065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7919688.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 10600600000065 its reverse (56000000600601), we get a palindrome (66600600600666).
The spelling of 10600600000065 in words is "ten trillion, six hundred billion, six hundred million, sixty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •