Base | Representation |
---|---|
bin | 110001100000101100… |
… | …0001001110110110011 |
3 | 101011102212111221120011 |
4 | 1203001120021312303 |
5 | 3220222312041434 |
6 | 120502214355351 |
7 | 10452540155140 |
oct | 1430130116663 |
9 | 334385457504 |
10 | 106323549619 |
11 | 41100965571 |
12 | 1873365bb57 |
13 | a045930291 |
14 | 5208c133c7 |
15 | 2b74483e64 |
hex | 18c1609db3 |
106323549619 has 4 divisors (see below), whose sum is σ = 121512628144. Its totient is φ = 91134471096.
The previous prime is 106323549589. The next prime is 106323549623. The reversal of 106323549619 is 916945323601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 916945323601 = 141181 ⋅6494821.
It is a cyclic number.
It is not a de Polignac number, because 106323549619 - 211 = 106323547571 is a prime.
It is a super-2 number, since 2×1063235496192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106323549649) 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 3 ways as a sum of consecutive naturals, for example, 7594539252 + ... + 7594539265.
It is an arithmetic number, because the mean of its divisors is an integer number (30378157036).
Almost surely, 2106323549619 is an apocalyptic number.
106323549619 is a deficient number, since it is larger than the sum of its proper divisors (15189078525).
106323549619 is an equidigital number, since it uses as much as digits as its factorization.
106323549619 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15189078524.
The product of its (nonzero) digits is 1049760, while the sum is 49.
The spelling of 106323549619 in words is "one hundred six billion, three hundred twenty-three million, five hundred forty-nine thousand, six hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •