Base | Representation |
---|---|
bin | 110001101011101001… |
… | …0110111100000010011 |
3 | 101012101111102200210010 |
4 | 1203113102313200103 |
5 | 3222000430344413 |
6 | 121002512010003 |
7 | 10464623524251 |
oct | 1432722674023 |
9 | 335344380703 |
10 | 106691262483 |
11 | 4127a4886a3 |
12 | 18816830903 |
13 | a0a3b78860 |
14 | 52419b15d1 |
15 | 2b968badc3 |
hex | 18d74b7813 |
106691262483 has 8 divisors (see below), whose sum is σ = 153197710288. Its totient is φ = 65656161504.
The previous prime is 106691262481. The next prime is 106691262527. The reversal of 106691262483 is 384262196601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106691262483 - 21 = 106691262481 is a prime.
It is a super-2 number, since 2×1066912624832 (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 (106691262481) 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, 1367836660 + ... + 1367836737.
It is an arithmetic number, because the mean of its divisors is an integer number (19149713786).
Almost surely, 2106691262483 is an apocalyptic number.
106691262483 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106691262483 is a deficient number, since it is larger than the sum of its proper divisors (46506447805).
106691262483 is a wasteful number, since it uses less digits than its factorization.
106691262483 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2735673413.
The product of its (nonzero) digits is 746496, while the sum is 48.
The spelling of 106691262483 in words is "one hundred six billion, six hundred ninety-one million, two hundred sixty-two thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •