Base | Representation |
---|---|
bin | 10111001100010100110010… |
… | …001010110101000010111100 |
3 | 111101011022001011011122002012 |
4 | 113030110302022311002330 |
5 | 101332200114110342340 |
6 | 1000535025303350352 |
7 | 30325255100361626 |
oct | 2714246212650274 |
9 | 441138034148065 |
10 | 102002020012220 |
11 | 2a5568a5123049 |
12 | b5348121523b8 |
13 | 44bb998040503 |
14 | 1b28cd1a89c16 |
15 | bbd48ecb4565 |
hex | 5cc5322b50bc |
102002020012220 has 48 divisors (see below), whose sum is σ = 217904091850368. Its totient is φ = 40101972057600.
The previous prime is 102002020012183. The next prime is 102002020012247. The reversal of 102002020012220 is 22210020200201.
It is a junction number, because it is equal to n+sod(n) for n = 102002020012195 and 102002020012204.
It is a congruent number.
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, 184015412 + ... + 184568891.
It is an arithmetic number, because the mean of its divisors is an integer number (4539668580216).
Almost surely, 2102002020012220 is an apocalyptic number.
102002020012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102002020012220 is an abundant number, since it is smaller than the sum of its proper divisors (115902071838148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002020012220 is a wasteful number, since it uses less digits than its factorization.
102002020012220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368584550 (or 368584548 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 102002020012220 its reverse (22210020200201), we get a palindrome (124212040212421).
The spelling of 102002020012220 in words is "one hundred two trillion, two billion, twenty million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •