Base | Representation |
---|---|
bin | 100000001000101000111101… |
… | …010000001111100110000111 |
3 | 200112102010120211101001122101 |
4 | 200020220331100033212013 |
5 | 122011032320201314120 |
6 | 1220330400012012531 |
7 | 41524562264314510 |
oct | 4010507520174607 |
9 | 615363524331571 |
10 | 141331221510535 |
11 | 4103a264055401 |
12 | 13a26b30161147 |
13 | 60b2627c86214 |
14 | 26c867920da07 |
15 | 11515393c490a |
hex | 808a3d40f987 |
141331221510535 has 16 divisors (see below), whose sum is σ = 200509319188800. Its totient is φ = 93571015620096.
The previous prime is 141331221510433. The next prime is 141331221510541. The reversal of 141331221510535 is 535015122133141.
It is not a de Polignac number, because 141331221510535 - 219 = 141331220986247 is a prime.
It is a super-2 number, since 2×1413312215105352 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141331221510494 and 141331221510503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69621290370 + ... + 69621292399.
It is an arithmetic number, because the mean of its divisors is an integer number (12531832449300).
Almost surely, 2141331221510535 is an apocalyptic number.
141331221510535 is a deficient number, since it is larger than the sum of its proper divisors (59178097678265).
141331221510535 is a wasteful number, since it uses less digits than its factorization.
141331221510535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139242582810.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 141331221510535 its reverse (535015122133141), we get a palindrome (676346343643676).
The spelling of 141331221510535 in words is "one hundred forty-one trillion, three hundred thirty-one billion, two hundred twenty-one million, five hundred ten thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •