Base | Representation |
---|---|
bin | 10010110000101111… |
… | …00100111001011001 |
3 | 221222222012112012110 |
4 | 21120113210321121 |
5 | 131112030310131 |
6 | 4343252502533 |
7 | 504414631326 |
oct | 113027447131 |
9 | 27888175173 |
10 | 10072510041 |
11 | 42a973a970 |
12 | 1b5131aa49 |
13 | c46a27619 |
14 | 6b7a39b4d |
15 | 3de432646 |
hex | 2585e4e59 |
10072510041 has 32 divisors (see below), whose sum is σ = 14916781440. Its totient is φ = 5994777600.
The previous prime is 10072509961. The next prime is 10072510043. The reversal of 10072510041 is 14001527001.
It is a happy number.
10072510041 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 10072510041 - 29 = 10072509529 is a prime.
It is a super-3 number, since 3×100725100413 (a number of 31 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10072510043) 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, 394071 + ... + 418851.
It is an arithmetic number, because the mean of its divisors is an integer number (466149420).
Almost surely, 210072510041 is an apocalyptic number.
10072510041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10072510041 is a deficient number, since it is larger than the sum of its proper divisors (4844271399).
10072510041 is a wasteful number, since it uses less digits than its factorization.
10072510041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25017.
The product of its (nonzero) digits is 280, while the sum is 21.
The spelling of 10072510041 in words is "ten billion, seventy-two million, five hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •