Base | Representation |
---|---|
bin | 1100110100101110111101… |
… | …1101110111110101111001 |
3 | 1211220221211020012120112021 |
4 | 3031023233131313311321 |
5 | 3322004001131013001 |
6 | 45553255134514441 |
7 | 2653461425425042 |
oct | 315135735676571 |
9 | 54827736176467 |
10 | 14100100251001 |
11 | 4546901003856 |
12 | 16b883b065a21 |
13 | 7b38314644bb |
14 | 36a63c9478c9 |
15 | 196b98d3bba1 |
hex | cd2ef777d79 |
14100100251001 has 4 divisors (see below), whose sum is σ = 14124537167092. Its totient is φ = 14075663334912.
The previous prime is 14100100250963. The next prime is 14100100251043. The reversal of 14100100251001 is 10015200100141.
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 14021280250000 + 78820001001 = 3744500^2 + 280749^2 .
It is a cyclic number.
It is not a de Polignac number, because 14100100251001 - 235 = 14065740512633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14100100251401) 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, 12218457180 + ... + 12218458333.
It is an arithmetic number, because the mean of its divisors is an integer number (3531134291773).
Almost surely, 214100100251001 is an apocalyptic number.
It is an amenable number.
14100100251001 is a deficient number, since it is larger than the sum of its proper divisors (24436916091).
14100100251001 is an equidigital number, since it uses as much as digits as its factorization.
14100100251001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24436916090.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 14100100251001 its reverse (10015200100141), we get a palindrome (24115300351142).
The spelling of 14100100251001 in words is "fourteen trillion, one hundred billion, one hundred million, two hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •