Base | Representation |
---|---|
bin | 110001101011111100… |
… | …1100101010000100111 |
3 | 101012102012112022102201 |
4 | 1203113321211100213 |
5 | 3222011030130432 |
6 | 121003513315331 |
7 | 10465106013655 |
oct | 1432771452047 |
9 | 335365468381 |
10 | 106701411367 |
11 | 4128518a701 |
12 | 1881a105b47 |
13 | a0a5cc0105 |
14 | 5243093dd5 |
15 | 2b97722ee7 |
hex | 18d7e65427 |
106701411367 has 4 divisors (see below), whose sum is σ = 107469047560. Its totient is φ = 105933775176.
The previous prime is 106701411329. The next prime is 106701411391. The reversal of 106701411367 is 763114107601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 763114107601 = 17 ⋅44889065153.
It is a cyclic number.
It is not a de Polignac number, because 106701411367 - 211 = 106701409319 is a prime.
It is a super-2 number, since 2×1067014113672 (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 (106701411767) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 383817888 + ... + 383818165.
It is an arithmetic number, because the mean of its divisors is an integer number (26867261890).
Almost surely, 2106701411367 is an apocalyptic number.
106701411367 is a deficient number, since it is larger than the sum of its proper divisors (767636193).
106701411367 is an equidigital number, since it uses as much as digits as its factorization.
106701411367 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 767636192.
The product of its (nonzero) digits is 21168, while the sum is 37.
Adding to 106701411367 its reverse (763114107601), we get a palindrome (869815518968).
The spelling of 106701411367 in words is "one hundred six billion, seven hundred one million, four hundred eleven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •