Base | Representation |
---|---|
bin | 110001110100001000… |
… | …1000110011110101111 |
3 | 101020010100020110222012 |
4 | 1203220101012132233 |
5 | 3223041324342312 |
6 | 121051043111435 |
7 | 10504652046341 |
oct | 1435021063657 |
9 | 336110213865 |
10 | 106976012207 |
11 | 41406196349 |
12 | 1889607257b |
13 | a11ab6710c |
14 | 526b735291 |
15 | 2bb18b6322 |
hex | 18e84467af |
106976012207 has 4 divisors (see below), whose sum is σ = 106981284480. Its totient is φ = 106970739936.
The previous prime is 106976012197. The next prime is 106976012243. The reversal of 106976012207 is 702210679601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 702210679601 = 587 ⋅1196270323.
It is a cyclic number.
It is not a de Polignac number, because 106976012207 - 220 = 106974963631 is a prime.
It is a super-2 number, since 2×1069760122072 (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 (106976012257) 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, 2605583 + ... + 2646320.
It is an arithmetic number, because the mean of its divisors is an integer number (26745321120).
Almost surely, 2106976012207 is an apocalyptic number.
106976012207 is a deficient number, since it is larger than the sum of its proper divisors (5272273).
106976012207 is an equidigital number, since it uses as much as digits as its factorization.
106976012207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5272272.
The product of its (nonzero) digits is 63504, while the sum is 41.
The spelling of 106976012207 in words is "one hundred six billion, nine hundred seventy-six million, twelve thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •