Base | Representation |
---|---|
bin | 11000001111101100001001… |
… | …010111000110111110100111 |
3 | 111222112212001100012112222020 |
4 | 120033230021113012332213 |
5 | 102434021410342020011 |
6 | 1014441425252234223 |
7 | 31313600161101015 |
oct | 3017541127067647 |
9 | 458485040175866 |
10 | 106631310110631 |
11 | 30a810a2759709 |
12 | bb61a4200b973 |
13 | 476639ba63307 |
14 | 1c48da92c38b5 |
15 | c4dad223a006 |
hex | 60fb095c6fa7 |
106631310110631 has 8 divisors (see below), whose sum is σ = 149657979102720. Its totient is φ = 67346090596152.
The previous prime is 106631310110627. The next prime is 106631310110639. The reversal of 106631310110631 is 136011013136601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106631310110631 - 22 = 106631310110627 is a prime.
It is a super-2 number, since 2×1066313101106312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106631310110592 and 106631310110601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106631310110639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 935362369335 + ... + 935362369448.
It is an arithmetic number, because the mean of its divisors is an integer number (18707247387840).
Almost surely, 2106631310110631 is an apocalyptic number.
106631310110631 is a deficient number, since it is larger than the sum of its proper divisors (43026668992089).
106631310110631 is a wasteful number, since it uses less digits than its factorization.
106631310110631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1870724738805.
The product of its (nonzero) digits is 5832, while the sum is 33.
The spelling of 106631310110631 in words is "one hundred six trillion, six hundred thirty-one billion, three hundred ten million, one hundred ten thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •