Base | Representation |
---|---|
bin | 10111001100010100110001… |
… | …101000110111101100111000 |
3 | 111101011022000112102100210202 |
4 | 113030110301220313230320 |
5 | 101332200104321011300 |
6 | 1000535024344501332 |
7 | 30325254631614335 |
oct | 2714246150675470 |
9 | 441138015370722 |
10 | 102002011110200 |
11 | 2a5568a00a2903 |
12 | b53480b17a848 |
13 | 44bb996244646 |
14 | 1b28cd080d98c |
15 | bbd48e106ad5 |
hex | 5cc531a37b38 |
102002011110200 has 48 divisors (see below), whose sum is σ = 251104950888480. Its totient is φ = 38400757122560.
The previous prime is 102002011110199. The next prime is 102002011110211. The reversal of 102002011110200 is 2011110200201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15000292352 + ... + 15000299151.
It is an arithmetic number, because the mean of its divisors is an integer number (5231353143510).
Almost surely, 2102002011110200 is an apocalyptic number.
102002011110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102002011110200 is an abundant number, since it is smaller than the sum of its proper divisors (149102939778280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002011110200 is a wasteful number, since it uses less digits than its factorization.
102002011110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30000591536 (or 30000591527 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102002011110200 its reverse (2011110200201), we get a palindrome (104013121310401).
Subtracting from 102002011110200 its reverse (2011110200201), we obtain a palindrome (99990900909999).
The spelling of 102002011110200 in words is "one hundred two trillion, two billion, eleven million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •