Base | Representation |
---|---|
bin | 10111001111001111011001… |
… | …111111001000001111011100 |
3 | 111101212110021021000120122110 |
4 | 113033033121333020033130 |
5 | 101343441010411404040 |
6 | 1001211045232114020 |
7 | 30345610563313533 |
oct | 2717173177101734 |
9 | 441773237016573 |
10 | 102202404013020 |
11 | 2a623883721783 |
12 | b567616395910 |
13 | 4504850a8b89c |
14 | 1b348a0b6931a |
15 | bc37bbcdb980 |
hex | 5cf3d9fc83dc |
102202404013020 has 48 divisors (see below), whose sum is σ = 286362870433920. Its totient is φ = 27235294479936.
The previous prime is 102202404012991. The next prime is 102202404013033. The reversal of 102202404013020 is 20310404202201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 583659342 + ... + 583834421.
It is an arithmetic number, because the mean of its divisors is an integer number (5965893134040).
Almost surely, 2102202404013020 is an apocalyptic number.
102202404013020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102202404013020 is an abundant number, since it is smaller than the sum of its proper divisors (184160466420900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102202404013020 is a wasteful number, since it uses less digits than its factorization.
102202404013020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1167495234 (or 1167495232 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 102202404013020 its reverse (20310404202201), we get a palindrome (122512808215221).
The spelling of 102202404013020 in words is "one hundred two trillion, two hundred two billion, four hundred four million, thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •