Base | Representation |
---|---|
bin | 1010111011010100111110… |
… | …1111111110111101000001 |
3 | 1120112120011111210011211022 |
4 | 2232311033233332331001 |
5 | 3033320403021134401 |
6 | 41315153234555225 |
7 | 2350003035545150 |
oct | 256651757767501 |
9 | 46476144704738 |
10 | 12014361505601 |
11 | 39122979465a4 |
12 | 1420569438b15 |
13 | 691c45b828b0 |
14 | 2d76d90b9597 |
15 | 15c7c3b6171b |
hex | aed4fbfef41 |
12014361505601 has 8 divisors (see below), whose sum is σ = 14786906468544. Its totient is φ = 9505868443920.
The previous prime is 12014361505529. The next prime is 12014361505607. The reversal of 12014361505601 is 10650516341021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12014361505601 - 218 = 12014361243457 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12014361505607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66012975215 + ... + 66012975396.
It is an arithmetic number, because the mean of its divisors is an integer number (1848363308568).
Almost surely, 212014361505601 is an apocalyptic number.
It is an amenable number.
12014361505601 is a deficient number, since it is larger than the sum of its proper divisors (2772544962943).
12014361505601 is a wasteful number, since it uses less digits than its factorization.
12014361505601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132025950631.
The product of its (nonzero) digits is 21600, while the sum is 35.
Adding to 12014361505601 its reverse (10650516341021), we get a palindrome (22664877846622).
The spelling of 12014361505601 in words is "twelve trillion, fourteen billion, three hundred sixty-one million, five hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •