Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …100010011111101001101000 |
3 | 111101011022021102200200012011 |
4 | 113030110313202133221220 |
5 | 101332200310141231440 |
6 | 1000535042242325304 |
7 | 30325260243210454 |
oct | 2714246742375150 |
9 | 441138242620164 |
10 | 102002110102120 |
11 | 2a556940a65a08 |
12 | b534838359834 |
13 | 44bb9b08c4347 |
14 | 1b28cdda1b664 |
15 | bbd497b5c9ea |
hex | 5cc53789fa68 |
102002110102120 has 32 divisors (see below), whose sum is σ = 229783611409920. Its totient is φ = 40751268275520.
The previous prime is 102002110102117. The next prime is 102002110102159. The reversal of 102002110102120 is 21201011200201.
It is a self number, because there is not a number n which added to its sum of digits gives 102002110102120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1549209336 + ... + 1549275175.
It is an arithmetic number, because the mean of its divisors is an integer number (7180737856560).
Almost surely, 2102002110102120 is an apocalyptic number.
102002110102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102002110102120 is an abundant number, since it is smaller than the sum of its proper divisors (127781501307800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002110102120 is a wasteful number, since it uses less digits than its factorization.
102002110102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3098485345 (or 3098485341 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102002110102120 its reverse (21201011200201), we get a palindrome (123203121302321).
The spelling of 102002110102120 in words is "one hundred two trillion, two billion, one hundred ten million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •