Base | Representation |
---|---|
bin | 11000010001000000001100… |
… | …110010000110010111001111 |
3 | 111222212111000010201222100010 |
4 | 120101000030302012113033 |
5 | 102442011224312041423 |
6 | 1014551113024004303 |
7 | 31323243535052550 |
oct | 3021001462062717 |
9 | 458774003658303 |
10 | 106721561830863 |
11 | 310063a6478951 |
12 | bb7742b160693 |
13 | 4771a52a7ac75 |
14 | 1c4d4cb7c8327 |
15 | c5111573a693 |
hex | 61100cc865cf |
106721561830863 has 64 divisors (see below), whose sum is σ = 163424437862400. Its totient is φ = 60683904933120.
The previous prime is 106721561830861. The next prime is 106721561830901. The reversal of 106721561830863 is 368038165127601.
It is not a de Polignac number, because 106721561830863 - 21 = 106721561830861 is a prime.
It is a super-3 number, since 3×1067215618308633 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106721561830861) 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 63 ways as a sum of consecutive naturals, for example, 37857948868 + ... + 37857951686.
It is an arithmetic number, because the mean of its divisors is an integer number (2553506841600).
Almost surely, 2106721561830863 is an apocalyptic number.
106721561830863 is a deficient number, since it is larger than the sum of its proper divisors (56702876031537).
106721561830863 is a wasteful number, since it uses less digits than its factorization.
106721561830863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8332.
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 106721561830863 in words is "one hundred six trillion, seven hundred twenty-one billion, five hundred sixty-one million, eight hundred thirty thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •