Base | Representation |
---|---|
bin | 110001100001010011… |
… | …0101100111000010111 |
3 | 101011111022021001200101 |
4 | 1203002212230320113 |
5 | 3220243044442221 |
6 | 120504231554531 |
7 | 10453210164253 |
oct | 1430246547027 |
9 | 334438231611 |
10 | 106344140311 |
11 | 41111549672 |
12 | 1873a52ba47 |
13 | a049c8c516 |
14 | 520b853263 |
15 | 2b7619ed91 |
hex | 18c29ace17 |
106344140311 has 4 divisors (see below), whose sum is σ = 106443621400. Its totient is φ = 106244659224.
The previous prime is 106344140299. The next prime is 106344140321. The reversal of 106344140311 is 113041443601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106344140311 - 29 = 106344139799 is a prime.
It is a super-2 number, since 2×1063441403112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106344140311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106344140321) 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, 49738941 + ... + 49741078.
It is an arithmetic number, because the mean of its divisors is an integer number (26610905350).
Almost surely, 2106344140311 is an apocalyptic number.
106344140311 is a deficient number, since it is larger than the sum of its proper divisors (99481089).
106344140311 is an equidigital number, since it uses as much as digits as its factorization.
106344140311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99481088.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 106344140311 its reverse (113041443601), we get a palindrome (219385583912).
The spelling of 106344140311 in words is "one hundred six billion, three hundred forty-four million, one hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •