Base | Representation |
---|---|
bin | 110010000101011001… |
… | …0001100100001000111 |
3 | 101021121200220211221212 |
4 | 1210022302030201013 |
5 | 3230233102104111 |
6 | 121224331202035 |
7 | 10525213243052 |
oct | 1441262144107 |
9 | 337550824855 |
10 | 107555113031 |
11 | 4168306a373 |
12 | 18a17ba631b |
13 | a1b0b26222 |
14 | 52c45dba99 |
15 | 2be765698b |
hex | 190ac8c847 |
107555113031 has 4 divisors (see below), whose sum is σ = 108199155792. Its totient is φ = 106911070272.
The previous prime is 107555113019. The next prime is 107555113051. The reversal of 107555113031 is 130311555701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130311555701 = 31 ⋅4203598571.
It is a cyclic number.
It is not a de Polignac number, because 107555113031 - 226 = 107488004167 is a prime.
It is a super-2 number, since 2×1075551130312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107555113051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 322021130 + ... + 322021463.
It is an arithmetic number, because the mean of its divisors is an integer number (27049788948).
Almost surely, 2107555113031 is an apocalyptic number.
107555113031 is a deficient number, since it is larger than the sum of its proper divisors (644042761).
107555113031 is an equidigital number, since it uses as much as digits as its factorization.
107555113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644042760.
The product of its (nonzero) digits is 7875, while the sum is 32.
Adding to 107555113031 its reverse (130311555701), we get a palindrome (237866668732).
The spelling of 107555113031 in words is "one hundred seven billion, five hundred fifty-five million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.195 sec. • engine limits •