Base | Representation |
---|---|
bin | 110001011011101010… |
… | …1001111100100011111 |
3 | 101011000010101110202011 |
4 | 1202313111033210133 |
5 | 3214401140430211 |
6 | 120433354212051 |
7 | 10445422506664 |
oct | 1426725174437 |
9 | 334003343664 |
10 | 106155014431 |
11 | 41024813594 |
12 | 186a7124027 |
13 | a019a4190b |
14 | 51d06a1a6b |
15 | 2b64792921 |
hex | 18b754f91f |
106155014431 has 4 divisors (see below), whose sum is σ = 109815532200. Its totient is φ = 102494496664.
The previous prime is 106155014429. The next prime is 106155014443. The reversal of 106155014431 is 134410551601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 134410551601 = 7741 ⋅17363461.
It is a cyclic number.
It is not a de Polignac number, because 106155014431 - 21 = 106155014429 is a prime.
It is a super-2 number, since 2×1061550144312 (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 = 106155014393 and 106155014402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106155014401) 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, 1830258841 + ... + 1830258898.
It is an arithmetic number, because the mean of its divisors is an integer number (27453883050).
Almost surely, 2106155014431 is an apocalyptic number.
106155014431 is a deficient number, since it is larger than the sum of its proper divisors (3660517769).
106155014431 is an equidigital number, since it uses as much as digits as its factorization.
106155014431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3660517768.
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 106155014431 in words is "one hundred six billion, one hundred fifty-five million, fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •