Base | Representation |
---|---|
bin | 1011000000111110001111… |
… | …0001001110100001111111 |
3 | 1120212211110200220102020021 |
4 | 2300033203301032201333 |
5 | 3041413003014440111 |
6 | 41431511535033011 |
7 | 2360005102414030 |
oct | 260174361164177 |
9 | 46784420812207 |
10 | 12111334140031 |
11 | 394a42a420085 |
12 | 143731136b767 |
13 | 69b12b418c59 |
14 | 2dc29804ca87 |
15 | 16009c1edd71 |
hex | b03e3c4e87f |
12111334140031 has 16 divisors (see below), whose sum is σ = 14754456755200. Its totient is φ = 9710276835168.
The previous prime is 12111334140013. The next prime is 12111334140043. The reversal of 12111334140031 is 13004143311121.
It is not a de Polignac number, because 12111334140031 - 211 = 12111334137983 is a prime.
It is a super-2 number, since 2×121113341400312 (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 = 12111334139978 and 12111334140005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111334140071) 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, 576335460 + ... + 576356473.
It is an arithmetic number, because the mean of its divisors is an integer number (922153547200).
Almost surely, 212111334140031 is an apocalyptic number.
12111334140031 is a deficient number, since it is larger than the sum of its proper divisors (2643122615169).
12111334140031 is a wasteful number, since it uses less digits than its factorization.
12111334140031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1152692038.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 12111334140031 its reverse (13004143311121), we get a palindrome (25115477451152).
The spelling of 12111334140031 in words is "twelve trillion, one hundred eleven billion, three hundred thirty-four million, one hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •