Base | Representation |
---|---|
bin | 1011000010101011000000… |
… | …1010000110001101110101 |
3 | 1120222121211121201222020020 |
4 | 2300222300022012031311 |
5 | 3042402302422443123 |
6 | 41453141152155353 |
7 | 2362060503643425 |
oct | 260526012061565 |
9 | 46877747658206 |
10 | 12140533015413 |
11 | 3960853425350 |
12 | 1440abbb38b59 |
13 | 6a0b028262ca |
14 | 2dd867d18485 |
15 | 160c0a82c7e3 |
hex | b0ab0286375 |
12140533015413 has 16 divisors (see below), whose sum is σ = 18267886670400. Its totient is φ = 7104178148480.
The previous prime is 12140533015367. The next prime is 12140533015439. The reversal of 12140533015413 is 31451033504121.
It is a cyclic number.
It is not a de Polignac number, because 12140533015413 - 212 = 12140533011317 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12140533015313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6343015248 + ... + 6343017161.
It is an arithmetic number, because the mean of its divisors is an integer number (1141742916900).
Almost surely, 212140533015413 is an apocalyptic number.
It is an amenable number.
12140533015413 is a deficient number, since it is larger than the sum of its proper divisors (6127353654987).
12140533015413 is a wasteful number, since it uses less digits than its factorization.
12140533015413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12686032452.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 12140533015413 its reverse (31451033504121), we get a palindrome (43591566519534).
The spelling of 12140533015413 in words is "twelve trillion, one hundred forty billion, five hundred thirty-three million, fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •