Base | Representation |
---|---|
bin | 1100110110010010100100… |
… | …1010001001011000101101 |
3 | 1212000111211121221001002101 |
4 | 3031210221022021120231 |
5 | 3322423231004243120 |
6 | 50013440232455101 |
7 | 2655426133265056 |
oct | 315445112113055 |
9 | 55014747831071 |
10 | 14126837962285 |
11 | 4557181820004 |
12 | 1701a6154a491 |
13 | 7b62029bc139 |
14 | 36ba579d172d |
15 | 19771136190a |
hex | cd92928962d |
14126837962285 has 4 divisors (see below), whose sum is σ = 16952205554748. Its totient is φ = 11301470369824.
The previous prime is 14126837962267. The next prime is 14126837962297. The reversal of 14126837962285 is 58226973862141.
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 5878350569961 + 8248487392324 = 2424531^2 + 2872018^2 .
It is a cyclic number.
It is not a de Polignac number, because 14126837962285 - 29 = 14126837961773 is a prime.
It is a super-2 number, since 2×141268379622852 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1412683796224 + ... + 1412683796233.
It is an arithmetic number, because the mean of its divisors is an integer number (4238051388687).
Almost surely, 214126837962285 is an apocalyptic number.
It is an amenable number.
14126837962285 is a deficient number, since it is larger than the sum of its proper divisors (2825367592463).
14126837962285 is an equidigital number, since it uses as much as digits as its factorization.
14126837962285 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2825367592462.
The product of its digits is 69672960, while the sum is 64.
The spelling of 14126837962285 in words is "fourteen trillion, one hundred twenty-six billion, eight hundred thirty-seven million, nine hundred sixty-two thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •