Base | Representation |
---|---|
bin | 1001101001110000101001… |
… | …0001101110000000111101 |
3 | 1101120121002202202111002101 |
4 | 2122130022101232000331 |
5 | 2342340444332334001 |
6 | 34323321155025101 |
7 | 2143523640456451 |
oct | 232341221560075 |
9 | 41517082674071 |
10 | 10613036605501 |
11 | 3421a66534250 |
12 | 1234a6459b191 |
13 | 5bca60933185 |
14 | 28996094a661 |
15 | 136109543a01 |
hex | 9a70a46e03d |
10613036605501 has 8 divisors (see below), whose sum is σ = 11707946409600. Its totient is φ = 9539808183840.
The previous prime is 10613036605499. The next prime is 10613036605543. The reversal of 10613036605501 is 10550663031601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10613036605501 - 21 = 10613036605499 is a prime.
It is a super-2 number, since 2×106130366055012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10613036695501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5420344581 + ... + 5420346538.
It is an arithmetic number, because the mean of its divisors is an integer number (1463493301200).
Almost surely, 210613036605501 is an apocalyptic number.
10613036605501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10613036605501 is a deficient number, since it is larger than the sum of its proper divisors (1094909804099).
10613036605501 is a wasteful number, since it uses less digits than its factorization.
10613036605501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10840691219.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 10613036605501 in words is "ten trillion, six hundred thirteen billion, thirty-six million, six hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •