Base | Representation |
---|---|
bin | 110001110001111001… |
… | …0001011010111100001 |
3 | 101012221002201010221222 |
4 | 1203203302023113201 |
5 | 3222413101000042 |
6 | 121035355024425 |
7 | 10503046531616 |
oct | 1434362132741 |
9 | 335832633858 |
10 | 106900796897 |
11 | 41377792a34 |
12 | 18874a3b115 |
13 | a1083c080b |
14 | 526175650d |
15 | 2ba9eaa2d2 |
hex | 18e3c8b5e1 |
106900796897 has 4 divisors (see below), whose sum is σ = 106902610176. Its totient is φ = 106898983620.
The previous prime is 106900796881. The next prime is 106900796911. The reversal of 106900796897 is 798697009601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106900796897 - 24 = 106900796881 is a prime.
It is a super-2 number, since 2×1069007968972 (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 (106900796297) 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 3 ways as a sum of consecutive naturals, for example, 815129 + ... + 937142.
It is an arithmetic number, because the mean of its divisors is an integer number (26725652544).
Almost surely, 2106900796897 is an apocalyptic number.
It is an amenable number.
106900796897 is a deficient number, since it is larger than the sum of its proper divisors (1813279).
106900796897 is an equidigital number, since it uses as much as digits as its factorization.
106900796897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1813278.
The product of its (nonzero) digits is 10287648, while the sum is 62.
The spelling of 106900796897 in words is "one hundred six billion, nine hundred million, seven hundred ninety-six thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •