Base | Representation |
---|---|
bin | 110001011010000110… |
… | …1001100110000111001 |
3 | 101010212110201020012001 |
4 | 1202310031030300321 |
5 | 3214244224333022 |
6 | 120424242221001 |
7 | 10444214666560 |
oct | 1426415146071 |
9 | 333773636161 |
10 | 106102574137 |
11 | 40aa81563aa |
12 | 18691654761 |
13 | a00bc10861 |
14 | 51c7730bd7 |
15 | 2b5ed84b27 |
hex | 18b434cc39 |
106102574137 has 32 divisors (see below), whose sum is σ = 127513152000. Its totient is φ = 86370375168.
The previous prime is 106102574107. The next prime is 106102574141. The reversal of 106102574137 is 731475201601.
It is not a de Polignac number, because 106102574137 - 27 = 106102574009 is a prime.
It is a super-2 number, since 2×1061025741372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106102574096 and 106102574105.
It is not an unprimeable number, because it can be changed into a prime (106102574107) 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 31 ways as a sum of consecutive naturals, for example, 3098413 + ... + 3132469.
It is an arithmetic number, because the mean of its divisors is an integer number (3984786000).
Almost surely, 2106102574137 is an apocalyptic number.
It is an amenable number.
106102574137 is a deficient number, since it is larger than the sum of its proper divisors (21410577863).
106102574137 is a wasteful number, since it uses less digits than its factorization.
106102574137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34345.
The product of its (nonzero) digits is 35280, while the sum is 37.
Adding to 106102574137 its reverse (731475201601), we get a palindrome (837577775738).
The spelling of 106102574137 in words is "one hundred six billion, one hundred two million, five hundred seventy-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •