Base | Representation |
---|---|
bin | 10010101001110001… |
… | …10001010111011001 |
3 | 221211220022010210202 |
4 | 21110320301113121 |
5 | 131002102244001 |
6 | 4333404551545 |
7 | 503105320400 |
oct | 112470612731 |
9 | 27756263722 |
10 | 10014103001 |
11 | 4279777891 |
12 | 1b358525b5 |
13 | c378b7746 |
14 | 6add94637 |
15 | 3d924696b |
hex | 254e315d9 |
10014103001 has 12 divisors (see below), whose sum is σ = 11668475700. Its totient is φ = 8569209600.
The previous prime is 10014102991. The next prime is 10014103027. The reversal of 10014103001 is 10030141001.
10014103001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 6684697600 + 3329405401 = 81760^2 + 57701^2 .
It is not a de Polignac number, because 10014103001 - 222 = 10009908697 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10014103051) 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 11 ways as a sum of consecutive naturals, for example, 140576 + ... + 199473.
It is an arithmetic number, because the mean of its divisors is an integer number (972372975).
Almost surely, 210014103001 is an apocalyptic number.
It is an amenable number.
10014103001 is a deficient number, since it is larger than the sum of its proper divisors (1654372699).
10014103001 is an equidigital number, since it uses as much as digits as its factorization.
10014103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340664 (or 340657 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10014103001 its reverse (10030141001), we get a palindrome (20044244002).
The spelling of 10014103001 in words is "ten billion, fourteen million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •