Base | Representation |
---|---|
bin | 1011010100001110111110… |
… | …0000101000111010001111 |
3 | 1122001110121100102200220121 |
4 | 2311003233200220322033 |
5 | 3112323203330200030 |
6 | 42243515433125411 |
7 | 2422631252414155 |
oct | 265035740507217 |
9 | 48043540380817 |
10 | 12442243600015 |
11 | 3a677a9164129 |
12 | 148b482259867 |
13 | 6c33b5b69148 |
14 | 3102ca2d93d5 |
15 | 1689b828147a |
hex | b50ef828e8f |
12442243600015 has 16 divisors (see below), whose sum is σ = 15038342928000. Its totient is φ = 9882030052512.
The previous prime is 12442243599991. The next prime is 12442243600019. The reversal of 12442243600015 is 51000634224421.
It is a cyclic number.
It is not a de Polignac number, because 12442243600015 - 25 = 12442243599983 is a prime.
It is a super-2 number, since 2×124422436000152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12442243600019) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 68226744 + ... + 68408866.
It is an arithmetic number, because the mean of its divisors is an integer number (939896433000).
Almost surely, 212442243600015 is an apocalyptic number.
12442243600015 is a deficient number, since it is larger than the sum of its proper divisors (2596099327985).
12442243600015 is a wasteful number, since it uses less digits than its factorization.
12442243600015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280566.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 12442243600015 its reverse (51000634224421), we get a palindrome (63442877824436).
The spelling of 12442243600015 in words is "twelve trillion, four hundred forty-two billion, two hundred forty-three million, six hundred thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •