Base | Representation |
---|---|
bin | 10011001011111110… |
… | …10110110111000000 |
3 | 222120220020011021020 |
4 | 21211333112313000 |
5 | 132044031321422 |
6 | 4422055025440 |
7 | 513161261514 |
oct | 114577266700 |
9 | 28526204236 |
10 | 10301042112 |
11 | 4406740449 |
12 | 1bb596b280 |
13 | c821916ba |
14 | 6da128144 |
15 | 40452595c |
hex | 265fd6dc0 |
10301042112 has 56 divisors (see below), whose sum is σ = 27291042192. Its totient is φ = 3429120000.
The previous prime is 10301042107. The next prime is 10301042113. The reversal of 10301042112 is 21124010301.
It is a super-2 number, since 2×103010421122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301042091 and 10301042100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301042113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110862 + ... + 181362.
Almost surely, 210301042112 is an apocalyptic number.
10301042112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10301042112 is an abundant number, since it is smaller than the sum of its proper divisors (16990000080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301042112 is an equidigital number, since it uses as much as digits as its factorization.
10301042112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71277 (or 71267 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10301042112 its reverse (21124010301), we get a palindrome (31425052413).
The spelling of 10301042112 in words is "ten billion, three hundred one million, forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •