Base | Representation |
---|---|
bin | 10011110001001011… |
… | …00100100100000001 |
3 | 1000101122022210002011 |
4 | 21320211210210001 |
5 | 133213420041401 |
6 | 4513042252521 |
7 | 524000301400 |
oct | 117045444401 |
9 | 30348283064 |
10 | 10613049601 |
11 | 4556876280 |
12 | 2082357141 |
13 | 1001a04a0b |
14 | 729745637 |
15 | 421b07451 |
hex | 278964901 |
10613049601 has 24 divisors (see below), whose sum is σ = 13781379744. Its totient is φ = 8077567680.
The previous prime is 10613049589. The next prime is 10613049613. The reversal of 10613049601 is 10694031601.
It is an interprime number because it is at equal distance from previous prime (10613049589) and next prime (10613049613).
It is not a de Polignac number, because 10613049601 - 229 = 10076178689 is a prime.
It is a super-2 number, since 2×106130496012 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10613049001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 205780 + ... + 252133.
It is an arithmetic number, because the mean of its divisors is an integer number (574224156).
Almost surely, 210613049601 is an apocalyptic number.
10613049601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10613049601 is a deficient number, since it is larger than the sum of its proper divisors (3168330143).
10613049601 is a wasteful number, since it uses less digits than its factorization.
10613049601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457981 (or 457974 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 10613049601 in words is "ten billion, six hundred thirteen million, forty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •