Base | Representation |
---|---|
bin | 110001011010101100… |
… | …0100010100101110111 |
3 | 101010220211212122101011 |
4 | 1202311120202211313 |
5 | 3214314303334333 |
6 | 120430225413051 |
7 | 10444544605420 |
oct | 1426530424567 |
9 | 333824778334 |
10 | 106122324343 |
11 | 41008315a92 |
12 | 1869819a187 |
13 | a013037379 |
14 | 51ca1d2647 |
15 | 2b619869cd |
hex | 18b5622977 |
106122324343 has 8 divisors (see below), whose sum is σ = 122743893888. Its totient is φ = 89866064184.
The previous prime is 106122324337. The next prime is 106122324391. The reversal of 106122324343 is 343423221601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106122324343 - 29 = 106122323831 is a prime.
It is a super-2 number, since 2×1061223243432 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106122324643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91326721 + ... + 91327882.
It is an arithmetic number, because the mean of its divisors is an integer number (15342986736).
Almost surely, 2106122324343 is an apocalyptic number.
106122324343 is a deficient number, since it is larger than the sum of its proper divisors (16621569545).
106122324343 is an equidigital number, since it uses as much as digits as its factorization.
106122324343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182654693.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 106122324343 its reverse (343423221601), we get a palindrome (449545545944).
The spelling of 106122324343 in words is "one hundred six billion, one hundred twenty-two million, three hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •