Base | Representation |
---|---|
bin | 110001100011011101… |
… | …1010011100100100110 |
3 | 101011200100200222000012 |
4 | 1203012323103210212 |
5 | 3220420130304114 |
6 | 120515342050222 |
7 | 10455050414315 |
oct | 1430673234446 |
9 | 334610628005 |
10 | 106416650534 |
11 | 41149474677 |
12 | 1875a879972 |
13 | a05bcc978c |
14 | 521732a27c |
15 | 2b7c72463e |
hex | 18c6ed3926 |
106416650534 has 4 divisors (see below), whose sum is σ = 159624975804. Its totient is φ = 53208325266.
The previous prime is 106416650533. The next prime is 106416650563. The reversal of 106416650534 is 435056614601.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1064166505342 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106416650491 and 106416650500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106416650533) 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 as a sum of consecutive naturals, namely, 26604162632 + ... + 26604162635.
It is an arithmetic number, because the mean of its divisors is an integer number (39906243951).
Almost surely, 2106416650534 is an apocalyptic number.
106416650534 is a deficient number, since it is larger than the sum of its proper divisors (53208325270).
106416650534 is an equidigital number, since it uses as much as digits as its factorization.
106416650534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53208325269.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 106416650534 in words is "one hundred six billion, four hundred sixteen million, six hundred fifty thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •