Base | Representation |
---|---|
bin | 110001101111110101… |
… | …0000111110010001001 |
3 | 101012202021110101000111 |
4 | 1203133222013302021 |
5 | 3222242340414301 |
6 | 121024443234321 |
7 | 10501246262200 |
oct | 1433752076211 |
9 | 335667411014 |
10 | 106831576201 |
11 | 41341704449 |
12 | 188558189a1 |
13 | a0c6c6591c |
14 | 5256498237 |
15 | 2ba3d85551 |
hex | 18dfa87c89 |
106831576201 has 27 divisors (see below), whose sum is σ = 126806424213. Its totient is φ = 89740210560.
The previous prime is 106831576169. The next prime is 106831576211. The reversal of 106831576201 is 102675138601.
It is a happy number.
The square root of 106831576201 is 326851.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1645519225 + 105186056976 = 40565^2 + 324324^2 .
It is not a de Polignac number, because 106831576201 - 25 = 106831576169 is a prime.
It is a super-2 number, since 2×1068315762012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106831576211) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 121261281 + ... + 121262161.
Almost surely, 2106831576201 is an apocalyptic number.
106831576201 is the 326851-st square number.
106831576201 is the 163426-th centered octagonal number.
It is an amenable number.
106831576201 is a deficient number, since it is larger than the sum of its proper divisors (19974848012).
106831576201 is an frugal number, since it uses more digits than its factorization.
106831576201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1882 (or 941 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 106831576201 in words is "one hundred six billion, eight hundred thirty-one million, five hundred seventy-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •