Base | Representation |
---|---|
bin | 1011000010010000100001… |
… | …0000111000001001011111 |
3 | 1120221221110222201000112022 |
4 | 2300210020100320021133 |
5 | 3042243221320100330 |
6 | 41450003342330355 |
7 | 2361416326653023 |
oct | 260441020701137 |
9 | 46857428630468 |
10 | 12133421253215 |
11 | 3958833a86129 |
12 | 143b6562899bb |
13 | 6a023b31bbb2 |
14 | 2dd3915c8383 |
15 | 1609412d8ae5 |
hex | b090843825f |
12133421253215 has 8 divisors (see below), whose sum is σ = 14565512168928. Its totient is φ = 9703132559200.
The previous prime is 12133421253209. The next prime is 12133421253287. The reversal of 12133421253215 is 51235212433121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12133421253215 - 212 = 12133421249119 is a prime.
It is a super-2 number, since 2×121334212532152 (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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 450540611 + ... + 450567540.
It is an arithmetic number, because the mean of its divisors is an integer number (1820689021116).
Almost surely, 212133421253215 is an apocalyptic number.
12133421253215 is a deficient number, since it is larger than the sum of its proper divisors (2432090915713).
12133421253215 is an equidigital number, since it uses as much as digits as its factorization.
12133421253215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 901110849.
The product of its digits is 43200, while the sum is 35.
Adding to 12133421253215 its reverse (51235212433121), we get a palindrome (63368633686336).
The spelling of 12133421253215 in words is "twelve trillion, one hundred thirty-three billion, four hundred twenty-one million, two hundred fifty-three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •