Base | Representation |
---|---|
bin | 10010110100111101… |
… | …00001010011010101 |
3 | 222002102202202012010 |
4 | 21122132201103111 |
5 | 131200104303012 |
6 | 4350555014433 |
7 | 505324413525 |
oct | 113236412325 |
9 | 28072682163 |
10 | 10107884757 |
11 | 4317701473 |
12 | 1b6113a419 |
13 | c51161ac9 |
14 | 6bc607685 |
15 | 3e25bdc3c |
hex | 25a7a14d5 |
10107884757 has 4 divisors (see below), whose sum is σ = 13477179680. Its totient is φ = 6738589836.
The previous prime is 10107884753. The next prime is 10107884777. The reversal of 10107884757 is 75748870101.
10107884757 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10107884757 - 22 = 10107884753 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10107884753) 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 3 ways as a sum of consecutive naturals, for example, 1684647457 + ... + 1684647462.
It is an arithmetic number, because the mean of its divisors is an integer number (3369294920).
Almost surely, 210107884757 is an apocalyptic number.
It is an amenable number.
10107884757 is a deficient number, since it is larger than the sum of its proper divisors (3369294923).
10107884757 is an equidigital number, since it uses as much as digits as its factorization.
10107884757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3369294922.
The product of its (nonzero) digits is 439040, while the sum is 48.
The spelling of 10107884757 in words is "ten billion, one hundred seven million, eight hundred eighty-four thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •