Base | Representation |
---|---|
bin | 10010110111101000… |
… | …10001110010100101 |
3 | 222011000001220010010 |
4 | 21123310101302211 |
5 | 131221333144410 |
6 | 4353120520433 |
7 | 506016454413 |
oct | 113364216245 |
9 | 28130056103 |
10 | 10130365605 |
11 | 4329366688 |
12 | 1b68780119 |
13 | c55a03499 |
14 | 6c15ba2b3 |
15 | 3e455ec20 |
hex | 25bd11ca5 |
10130365605 has 32 divisors (see below), whose sum is σ = 16711663104. Its totient is φ = 5236310016.
The previous prime is 10130365577. The next prime is 10130365607. The reversal of 10130365605 is 50656303101.
10130365605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10130365605 - 25 = 10130365573 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130365607) 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, 107124 + ... + 178146.
It is an arithmetic number, because the mean of its divisors is an integer number (522239472).
Almost surely, 210130365605 is an apocalyptic number.
10130365605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10130365605 is a deficient number, since it is larger than the sum of its proper divisors (6581297499).
10130365605 is a wasteful number, since it uses less digits than its factorization.
10130365605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71325.
The product of its (nonzero) digits is 8100, while the sum is 30.
Adding to 10130365605 its reverse (50656303101), we get a palindrome (60786668706).
The spelling of 10130365605 in words is "ten billion, one hundred thirty million, three hundred sixty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •