Base | Representation |
---|---|
bin | 1011000001001101001100… |
… | …1010011110000110101001 |
3 | 1120220012211121102020212011 |
4 | 2300103103022132012221 |
5 | 3041444214212341131 |
6 | 41433414251515521 |
7 | 2360206452126310 |
oct | 260232312360651 |
9 | 46805747366764 |
10 | 12115350512041 |
11 | 3951100576897 |
12 | 1438052458ba1 |
13 | 69b61b55063a |
14 | 2dc559625277 |
15 | 160234b0a0b1 |
hex | b04d329e1a9 |
12115350512041 has 16 divisors (see below), whose sum is σ = 13968911378304. Its totient is φ = 10292492254464.
The previous prime is 12115350512029. The next prime is 12115350512081. The reversal of 12115350512041 is 14021505351121.
It is not a de Polignac number, because 12115350512041 - 225 = 12115316957609 is a prime.
It is a super-2 number, since 2×121153505120412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12115350511994 and 12115350512012.
It is not an unprimeable number, because it can be changed into a prime (12115350512021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54806451 + ... + 55027063.
It is an arithmetic number, because the mean of its divisors is an integer number (873056961144).
Almost surely, 212115350512041 is an apocalyptic number.
It is an amenable number.
12115350512041 is a deficient number, since it is larger than the sum of its proper divisors (1853560866263).
12115350512041 is a wasteful number, since it uses less digits than its factorization.
12115350512041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290160.
The product of its (nonzero) digits is 6000, while the sum is 31.
Adding to 12115350512041 its reverse (14021505351121), we get a palindrome (26136855863162).
The spelling of 12115350512041 in words is "twelve trillion, one hundred fifteen billion, three hundred fifty million, five hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •