Base | Representation |
---|---|
bin | 110001100110000000… |
… | …1011011111111111111 |
3 | 101011220022120110222211 |
4 | 1203030001123333333 |
5 | 3221104022101444 |
6 | 120532034321251 |
7 | 10460136200356 |
oct | 1431401337777 |
9 | 334808513884 |
10 | 106502143999 |
11 | 41192758129 |
12 | 18783429227 |
13 | a073931424 |
14 | 522482299d |
15 | 2b84eb0c34 |
hex | 18cc05bfff |
106502143999 has 4 divisors (see below), whose sum is σ = 106502897664. Its totient is φ = 106501390336.
The previous prime is 106502143921. The next prime is 106502144003. The reversal of 106502143999 is 999341205601.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 106502143999 - 213 = 106502135807 is a prime.
It is a super-2 number, since 2×1065021439992 (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 (106502143399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94207 + ... + 471040.
It is an arithmetic number, because the mean of its divisors is an integer number (26625724416).
Almost surely, 2106502143999 is an apocalyptic number.
106502143999 is a deficient number, since it is larger than the sum of its proper divisors (753665).
106502143999 is an equidigital number, since it uses as much as digits as its factorization.
106502143999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753664.
The product of its (nonzero) digits is 524880, while the sum is 49.
The spelling of 106502143999 in words is "one hundred six billion, five hundred two million, one hundred forty-three thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •