Base | Representation |
---|---|
bin | 10010110100011111… |
… | …10001110011101001 |
3 | 222002011111102000102 |
4 | 21122033301303221 |
5 | 131143112121301 |
6 | 4350340115145 |
7 | 505246516562 |
oct | 113217616351 |
9 | 28064442012 |
10 | 10104020201 |
11 | 4315501a20 |
12 | 1b5b995ab5 |
13 | c5040aaa2 |
14 | 6bbcbd169 |
15 | 3e20a8b6b |
hex | 25a3f1ce9 |
10104020201 has 8 divisors (see below), whose sum is σ = 11026692864. Its totient is φ = 9182035120.
The previous prime is 10104020183. The next prime is 10104020207. The reversal of 10104020201 is 10202040101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10104020201 - 226 = 10036911337 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (11).
It is not an unprimeable number, because it can be changed into a prime (10104020207) 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, 140921 + ... + 200166.
It is an arithmetic number, because the mean of its divisors is an integer number (1378336608).
Almost surely, 210104020201 is an apocalyptic number.
10104020201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10104020201 is a deficient number, since it is larger than the sum of its proper divisors (922672663).
10104020201 is a wasteful number, since it uses less digits than its factorization.
10104020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343791.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10104020201 its reverse (10202040101), we get a palindrome (20306060302).
The spelling of 10104020201 in words is "ten billion, one hundred four million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •