Base | Representation |
---|---|
bin | 10110111110110100001101… |
… | …010110000101110000111111 |
3 | 111020212112212012002210112022 |
4 | 112332310031112011300333 |
5 | 101221442403423140414 |
6 | 554544340054030355 |
7 | 30201222146312150 |
oct | 2676641526056077 |
9 | 436775765083468 |
10 | 101073689271359 |
11 | 2a229124676332 |
12 | b4049120483bb |
13 | 4452291c9461c |
14 | 1ad5dc7c1b927 |
15 | ba425a48e18e |
hex | 5bed0d585c3f |
101073689271359 has 8 divisors (see below), whose sum is σ = 117139728411648. Its totient is φ = 85414385299320.
The previous prime is 101073689271349. The next prime is 101073689271481. The reversal of 101073689271359 is 953172986370101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101073689271359 - 212 = 101073689267263 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101073689271349) 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, 101683791527 + ... + 101683792520.
It is an arithmetic number, because the mean of its divisors is an integer number (14642466051456).
Almost surely, 2101073689271359 is an apocalyptic number.
101073689271359 is a deficient number, since it is larger than the sum of its proper divisors (16066039140289).
101073689271359 is an equidigital number, since it uses as much as digits as its factorization.
101073689271359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203367584125.
The product of its (nonzero) digits is 17146080, while the sum is 62.
The spelling of 101073689271359 in words is "one hundred one trillion, seventy-three billion, six hundred eighty-nine million, two hundred seventy-one thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •