Base | Representation |
---|---|
bin | 1110100111011100000011… |
… | …0011011110011110110001 |
3 | 2002220100022020011120022021 |
4 | 3221313000303132132301 |
5 | 4101300302041432001 |
6 | 54102440412311441 |
7 | 3246033052541140 |
oct | 351670063363661 |
9 | 62810266146267 |
10 | 16070707374001 |
11 | 5136604394055 |
12 | 197673b472581 |
13 | 8c75cc354557 |
14 | 3d7b7d86b757 |
15 | 1cd081668ba1 |
hex | e9dc0cde7b1 |
16070707374001 has 4 divisors (see below), whose sum is σ = 18366522713152. Its totient is φ = 13774892034852.
The previous prime is 16070707373971. The next prime is 16070707374031. The reversal of 16070707374001 is 10047370707061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (16070707373971) and next prime (16070707374031).
It is a cyclic number.
It is not a de Polignac number, because 16070707374001 - 215 = 16070707341233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16070707374031) 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, 1147907669565 + ... + 1147907669578.
It is an arithmetic number, because the mean of its divisors is an integer number (4591630678288).
Almost surely, 216070707374001 is an apocalyptic number.
It is an amenable number.
16070707374001 is a deficient number, since it is larger than the sum of its proper divisors (2295815339151).
16070707374001 is an equidigital number, since it uses as much as digits as its factorization.
16070707374001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2295815339150.
The product of its (nonzero) digits is 172872, while the sum is 43.
The spelling of 16070707374001 in words is "sixteen trillion, seventy billion, seven hundred seven million, three hundred seventy-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •