Base | Representation |
---|---|
bin | 1010111011010101111101… |
… | …0010010010011010001001 |
3 | 1120112120211200020121112112 |
4 | 2232311133102102122021 |
5 | 3033321421233001200 |
6 | 41315235145352105 |
7 | 2350012352210120 |
oct | 256653722223211 |
9 | 46476750217475 |
10 | 12014622156425 |
11 | 3912410a943a9 |
12 | 1420620798635 |
13 | 691c87b84155 |
14 | 2d7721968ab7 |
15 | 15c7db99b535 |
hex | aed5f492689 |
12014622156425 has 12 divisors (see below), whose sum is σ = 17026435970496. Its totient is φ = 8238598050000.
The previous prime is 12014622156419. The next prime is 12014622156437. The reversal of 12014622156425 is 52465122641021.
It is not a de Polignac number, because 12014622156425 - 214 = 12014622140041 is a prime.
It is a super-2 number, since 2×120146221564252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34327491701 + ... + 34327492050.
It is an arithmetic number, because the mean of its divisors is an integer number (1418869664208).
Almost surely, 212014622156425 is an apocalyptic number.
It is an amenable number.
12014622156425 is a deficient number, since it is larger than the sum of its proper divisors (5011813814071).
12014622156425 is an equidigital number, since it uses as much as digits as its factorization.
12014622156425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68654983768 (or 68654983763 counting only the distinct ones).
The product of its (nonzero) digits is 230400, while the sum is 41.
Adding to 12014622156425 its reverse (52465122641021), we get a palindrome (64479744797446).
The spelling of 12014622156425 in words is "twelve trillion, fourteen billion, six hundred twenty-two million, one hundred fifty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •