Base | Representation |
---|---|
bin | 100000001011010000011010… |
… | …111110101101001000011100 |
3 | 200120001022201100101112221010 |
4 | 200023100122332231020130 |
5 | 122022004044442122022 |
6 | 1220545134433335220 |
7 | 41543556240605514 |
oct | 4013203276551034 |
9 | 616038640345833 |
10 | 141511035114012 |
11 | 410a9547156073 |
12 | 13a55953407510 |
13 | 60c65830c7265 |
14 | 26d3256368844 |
15 | 115606055e50c |
hex | 80b41afad21c |
141511035114012 has 24 divisors (see below), whose sum is σ = 340843783501312. Its totient is φ = 45648721004400.
The previous prime is 141511035113993. The next prime is 141511035114019. The reversal of 141511035114012 is 210411530115141.
It is a super-2 number, since 2×1415110351140122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141511035114019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190203003814 + ... + 190203004557.
Almost surely, 2141511035114012 is an apocalyptic number.
141511035114012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
141511035114012 is an abundant number, since it is smaller than the sum of its proper divisors (199332748387300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141511035114012 is a wasteful number, since it uses less digits than its factorization.
141511035114012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380406008409 (or 380406008407 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 30.
Adding to 141511035114012 its reverse (210411530115141), we get a palindrome (351922565229153).
The spelling of 141511035114012 in words is "one hundred forty-one trillion, five hundred eleven billion, thirty-five million, one hundred fourteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •