Base | Representation |
---|---|
bin | 101110101010001110… |
… | …1001111110101101001 |
3 | 100120122012020102010122 |
4 | 1131110131033311221 |
5 | 3120203001413001 |
6 | 114010511253025 |
7 | 10145036104226 |
oct | 1352435176551 |
9 | 316565212118 |
10 | 100201201001 |
11 | 39549a69420 |
12 | 1750521a175 |
13 | 95ab3c75a5 |
14 | 4bc7a7694d |
15 | 2916c2eb1b |
hex | 175474fd69 |
100201201001 has 8 divisors (see below), whose sum is σ = 109502517600. Its totient is φ = 90931903840.
The previous prime is 100201200937. The next prime is 100201201013. The reversal of 100201201001 is 100102102001.
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 100201201001 - 26 = 100201200937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100201201001.
It is not an unprimeable number, because it can be changed into a prime (100201201021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7998311 + ... + 8010828.
It is an arithmetic number, because the mean of its divisors is an integer number (13687814700).
Almost surely, 2100201201001 is an apocalyptic number.
100201201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100201201001 is a deficient number, since it is larger than the sum of its proper divisors (9301316599).
100201201001 is a wasteful number, since it uses less digits than its factorization.
100201201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16009719.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100201201001 its reverse (100102102001), we get a palindrome (200303303002).
The spelling of 100201201001 in words is "one hundred billion, two hundred one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •