Base | Representation |
---|---|
bin | 110010001001110000… |
… | …0100000111010111110 |
3 | 101021222220022201000220 |
4 | 1210103200200322332 |
5 | 3231033034113313 |
6 | 121251040202210 |
7 | 10531641262302 |
oct | 1442340407276 |
9 | 337886281026 |
10 | 107701472958 |
11 | 41748745792 |
12 | 18a59009366 |
13 | a20524c331 |
14 | 52d9c19d02 |
15 | 2c05417823 |
hex | 1913820ebe |
107701472958 has 16 divisors (see below), whose sum is σ = 215647454736. Its totient is φ = 35859739520.
The previous prime is 107701472933. The next prime is 107701472959. The reversal of 107701472958 is 859274107701.
It is a self number, because there is not a number n which added to its sum of digits gives 107701472958.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107701472959) by changing a digit.
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, 10182141 + ... + 10192712.
It is an arithmetic number, because the mean of its divisors is an integer number (13477965921).
Almost surely, 2107701472958 is an apocalyptic number.
107701472958 is an abundant number, since it is smaller than the sum of its proper divisors (107945981778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107701472958 is a wasteful number, since it uses less digits than its factorization.
107701472958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20375739.
The product of its (nonzero) digits is 987840, while the sum is 51.
The spelling of 107701472958 in words is "one hundred seven billion, seven hundred one million, four hundred seventy-two thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •