Base | Representation |
---|---|
bin | 1100101111110010011100… |
… | …1001111011001111001001 |
3 | 1211121211111212110210020221 |
4 | 3023330213021323033021 |
5 | 3314110444102401301 |
6 | 45450244134550041 |
7 | 2644363054416502 |
oct | 313744711731711 |
9 | 54554455423227 |
10 | 14015135200201 |
11 | 45138704a0603 |
12 | 16a4288508321 |
13 | 7a88107b9705 |
14 | 36649c607ba9 |
15 | 194874a1bda1 |
hex | cbf2727b3c9 |
14015135200201 has 4 divisors (see below), whose sum is σ = 14059911990292. Its totient is φ = 13970358410112.
The previous prime is 14015135200123. The next prime is 14015135200223. The reversal of 14015135200201 is 10200253151041.
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 4520577607225 + 9494557592976 = 2126165^2 + 3081324^2 .
It is a cyclic number.
It is not a de Polignac number, because 14015135200201 - 223 = 14015126811593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14015135200291) 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, 22388394576 + ... + 22388395201.
It is an arithmetic number, because the mean of its divisors is an integer number (3514977997573).
Almost surely, 214015135200201 is an apocalyptic number.
It is an amenable number.
14015135200201 is a deficient number, since it is larger than the sum of its proper divisors (44776790091).
14015135200201 is an equidigital number, since it uses as much as digits as its factorization.
14015135200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44776790090.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 14015135200201 its reverse (10200253151041), we get a palindrome (24215388351242).
The spelling of 14015135200201 in words is "fourteen trillion, fifteen billion, one hundred thirty-five million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •