Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …100010111100101110011010 |
3 | 111101011022021102220201112220 |
4 | 113030110313202330232122 |
5 | 101332200310204034320 |
6 | 1000535042245044510 |
7 | 30325260244214613 |
oct | 2714246742745632 |
9 | 441138242821486 |
10 | 102002110221210 |
11 | 2a556941037431 |
12 | b5348383b6736 |
13 | 44bb9b0936604 |
14 | 1b28cdda4cc0a |
15 | bbd497b82e40 |
hex | 5cc5378bcb9a |
102002110221210 has 32 divisors (see below), whose sum is σ = 245587189360320. Its totient is φ = 27113659966848.
The previous prime is 102002110221133. The next prime is 102002110221227. The reversal of 102002110221210 is 12122011200201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 102002110221210.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5431412880 + ... + 5431431659.
It is an arithmetic number, because the mean of its divisors is an integer number (7674599667510).
Almost surely, 2102002110221210 is an apocalyptic number.
102002110221210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102002110221210 is an abundant number, since it is smaller than the sum of its proper divisors (143585079139110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002110221210 is a wasteful number, since it uses less digits than its factorization.
102002110221210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10862844862.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102002110221210 its reverse (12122011200201), we get a palindrome (114124121421411).
The spelling of 102002110221210 in words is "one hundred two trillion, two billion, one hundred ten million, two hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •