Base | Representation |
---|---|
bin | 110001110010001000… |
… | …0110110101100101111 |
3 | 101012221122211201020122 |
4 | 1203210100312230233 |
5 | 3222422130314303 |
6 | 121040243235155 |
7 | 10503205064252 |
oct | 1434420665457 |
9 | 335848751218 |
10 | 106908838703 |
11 | 41381285957 |
12 | 18877678abb |
13 | a109c77c94 |
14 | 526284b099 |
15 | 2baaa47e38 |
hex | 18e4436b2f |
106908838703 has 8 divisors (see below), whose sum is σ = 108510531888. Its totient is φ = 105307323264.
The previous prime is 106908838679. The next prime is 106908838811. The reversal of 106908838703 is 307838809601.
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 106908838703 - 212 = 106908834607 is a prime.
It is a super-2 number, since 2×1069088387032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106908838403) 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, 1643975 + ... + 1707767.
It is an arithmetic number, because the mean of its divisors is an integer number (13563816486).
Almost surely, 2106908838703 is an apocalyptic number.
106908838703 is a deficient number, since it is larger than the sum of its proper divisors (1601693185).
106908838703 is an equidigital number, since it uses as much as digits as its factorization.
106908838703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88873.
The product of its (nonzero) digits is 1741824, while the sum is 53.
It can be divided in two parts, 106 and 908838703, that added together give a palindrome (908838809).
The spelling of 106908838703 in words is "one hundred six billion, nine hundred eight million, eight hundred thirty-eight thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •