Base | Representation |
---|---|
bin | 101111101011000100… |
… | …0100111100110000000 |
3 | 100210020211001212220211 |
4 | 1133112020213212000 |
5 | 3134131432100420 |
6 | 115010430443504 |
7 | 10252664464666 |
oct | 1372610474600 |
9 | 323224055824 |
10 | 102376831360 |
11 | 3a466063741 |
12 | 17a11963594 |
13 | 986707592b |
14 | 4d529acc36 |
15 | 29e2c35e5a |
hex | 17d6227980 |
102376831360 has 64 divisors (see below), whose sum is σ = 246246364080. Its totient is φ = 40699459584.
The previous prime is 102376831321. The next prime is 102376831429. The reversal of 102376831360 is 63138673201.
102376831360 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 386367 + ... + 595006.
Almost surely, 2102376831360 is an apocalyptic number.
102376831360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102376831360 is an abundant number, since it is smaller than the sum of its proper divisors (143869532720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102376831360 is an equidigital number, since it uses as much as digits as its factorization.
102376831360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981555 (or 981543 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 102376831360 in words is "one hundred two billion, three hundred seventy-six million, eight hundred thirty-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •