Base | Representation |
---|---|
bin | 10110111110101111010011… |
… | …101010110110011111100001 |
3 | 111020212001021102120211212211 |
4 | 112332233103222312133201 |
5 | 101221401114211334001 |
6 | 554542105542122121 |
7 | 30200644555031212 |
oct | 2676572352663741 |
9 | 436761242524784 |
10 | 101068426668001 |
11 | 2a226974007561 |
12 | b4038a3720341 |
13 | 44519338cc840 |
14 | 1ad5a48d1d409 |
15 | ba404d464351 |
hex | 5bebd3ab67e1 |
101068426668001 has 4 divisors (see below), whose sum is σ = 108842921027092. Its totient is φ = 93293932308912.
The previous prime is 101068426667963. The next prime is 101068426668059. The reversal of 101068426668001 is 100866624860101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 65979863594401 + 35088563073600 = 8122799^2 + 5923560^2 .
It is a cyclic number.
It is not a de Polignac number, because 101068426668001 - 229 = 101067889797089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101068426665001) 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, 3887247179526 + ... + 3887247179551.
It is an arithmetic number, because the mean of its divisors is an integer number (27210730256773).
Almost surely, 2101068426668001 is an apocalyptic number.
It is an amenable number.
101068426668001 is a deficient number, since it is larger than the sum of its proper divisors (7774494359091).
101068426668001 is an equidigital number, since it uses as much as digits as its factorization.
101068426668001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7774494359090.
The product of its (nonzero) digits is 663552, while the sum is 49.
The spelling of 101068426668001 in words is "one hundred one trillion, sixty-eight billion, four hundred twenty-six million, six hundred sixty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •