Base | Representation |
---|---|
bin | 10010101001111010… |
… | …00111011100011011 |
3 | 221211222110000020022 |
4 | 21110331013130123 |
5 | 131002400221021 |
6 | 4333445221055 |
7 | 503121103205 |
oct | 112475073433 |
9 | 27758400208 |
10 | 10015242011 |
11 | 427a385615 |
12 | 1b3610178b |
13 | c37bc6008 |
14 | 6b01ad775 |
15 | 3d93be1ab |
hex | 254f4771b |
10015242011 has 4 divisors (see below), whose sum is σ = 10604373912. Its totient is φ = 9426110112.
The previous prime is 10015241993. The next prime is 10015242023. The reversal of 10015242011 is 11024251001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10015242011 - 26 = 10015241947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17), and also a Moran number because the ratio is a prime number: 589131883 = 10015242011 / (1 + 0 + 0 + 1 + 5 + 2 + 4 + 2 + 0 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10015242071) 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 3 ways as a sum of consecutive naturals, for example, 294565925 + ... + 294565958.
It is an arithmetic number, because the mean of its divisors is an integer number (2651093478).
Almost surely, 210015242011 is an apocalyptic number.
10015242011 is a deficient number, since it is larger than the sum of its proper divisors (589131901).
10015242011 is an equidigital number, since it uses as much as digits as its factorization.
10015242011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589131900.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 10015242011 its reverse (11024251001), we get a palindrome (21039493012).
The spelling of 10015242011 in words is "ten billion, fifteen million, two hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •