Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …100010011111011000001001 |
3 | 111101011022021102200121122201 |
4 | 113030110313202133120021 |
5 | 101332200310141213001 |
6 | 1000535042242320201 |
7 | 30325260243204265 |
oct | 2714246742373011 |
9 | 441138242617581 |
10 | 102002110101001 |
11 | 2a556940a65090 |
12 | b534838359061 |
13 | 44bb9b08c3996 |
14 | 1b28cdda1b0a5 |
15 | bbd497b5c501 |
hex | 5cc53789f609 |
102002110101001 has 8 divisors (see below), whose sum is σ = 117131609685600. Its totient is φ = 87848707263840.
The previous prime is 102002110100941. The next prime is 102002110101041. The reversal of 102002110101001 is 100101011200201.
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 102002110101001 - 213 = 102002110092809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102002110101041) 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, 244024186636 + ... + 244024187053.
It is an arithmetic number, because the mean of its divisors is an integer number (14641451210700).
Almost surely, 2102002110101001 is an apocalyptic number.
102002110101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102002110101001 is a deficient number, since it is larger than the sum of its proper divisors (15129499584599).
102002110101001 is a wasteful number, since it uses less digits than its factorization.
102002110101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488048373719.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102002110101001 its reverse (100101011200201), we get a palindrome (202103121301202).
The spelling of 102002110101001 in words is "one hundred two trillion, two billion, one hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •