Base | Representation |
---|---|
bin | 10010110101110011010011… |
… | …11101110000001101010100 |
3 | 12102200202201212201200000012 |
4 | 21122321221331300031110 |
5 | 20412301223234130030 |
6 | 224041053053335352 |
7 | 11504202414140162 |
oct | 1132715175601524 |
9 | 172622655650005 |
10 | 41431032333140 |
11 | 1222389071357a |
12 | 4791740a97558 |
13 | 1a16c113b4828 |
14 | a333b6296232 |
15 | 4bcab2422095 |
hex | 25ae69f70354 |
41431032333140 has 48 divisors (see below), whose sum is σ = 87030038571840. Its totient is φ = 16567676417280.
The previous prime is 41431032333091. The next prime is 41431032333167. The reversal of 41431032333140 is 4133323013414.
It is a happy number.
It is a super-2 number, since 2×414310323331402 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41431032333097 and 41431032333106.
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, 1405236839 + ... + 1405266321.
It is an arithmetic number, because the mean of its divisors is an integer number (1813125803580).
Almost surely, 241431032333140 is an apocalyptic number.
It is an amenable number.
41431032333140 is an abundant number, since it is smaller than the sum of its proper divisors (45599006238700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41431032333140 is a wasteful number, since it uses less digits than its factorization.
41431032333140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47192 (or 47190 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 41431032333140 its reverse (4133323013414), we get a palindrome (45564355346554).
The spelling of 41431032333140 in words is "forty-one trillion, four hundred thirty-one billion, thirty-two million, three hundred thirty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •