Base | Representation |
---|---|
bin | 11000011001101111011011… |
… | …001111001111110011010100 |
3 | 112001222212220112001220112122 |
4 | 120121233123033033303110 |
5 | 103031331002131013330 |
6 | 1020131020315435112 |
7 | 31414521565415630 |
oct | 3031573317176324 |
9 | 461885815056478 |
10 | 107322026032340 |
11 | 312180198a7929 |
12 | 10053889455a98 |
13 | 47b65679381b2 |
14 | 1c705b1585dc0 |
15 | c61a5b1ee5e5 |
hex | 619bdb3cfcd4 |
107322026032340 has 96 divisors (see below), whose sum is σ = 261803977473024. Its totient is φ = 36191717890560.
The previous prime is 107322026032339. The next prime is 107322026032357. The reversal of 107322026032340 is 43230620223701.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 107322026032340.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 282082517 + ... + 282462723.
It is an arithmetic number, because the mean of its divisors is an integer number (2727124765344).
Almost surely, 2107322026032340 is an apocalyptic number.
107322026032340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107322026032340 is an abundant number, since it is smaller than the sum of its proper divisors (154481951440684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107322026032340 is a wasteful number, since it uses less digits than its factorization.
107322026032340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 413337 (or 413335 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 35.
The spelling of 107322026032340 in words is "one hundred seven trillion, three hundred twenty-two billion, twenty-six million, thirty-two thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •