Base | Representation |
---|---|
bin | 11101101101001110111… |
… | …010011011001101000111 |
3 | 21020011022000002212102011 |
4 | 131231032322123031013 |
5 | 231421323422413411 |
6 | 4201453242355051 |
7 | 300326423425654 |
oct | 35551672331507 |
9 | 7204260085364 |
10 | 2041433404231 |
11 | 717848a33721 |
12 | 28b787abba87 |
13 | 11a67758ca00 |
14 | 70b3d586c2b |
15 | 38180756c21 |
hex | 1db4ee9b347 |
2041433404231 has 48 divisors (see below), whose sum is σ = 2328720337152. Its totient is φ = 1785282470400.
The previous prime is 2041433404177. The next prime is 2041433404237. The reversal of 2041433404231 is 1324043341402.
It is not a de Polignac number, because 2041433404231 - 27 = 2041433404103 is a prime.
It is a super-2 number, since 2×20414334042312 (a number of 25 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 = 2041433404193 and 2041433404202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2041433404237) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 286674351 + ... + 286681471.
It is an arithmetic number, because the mean of its divisors is an integer number (48515007024).
Almost surely, 22041433404231 is an apocalyptic number.
2041433404231 is a deficient number, since it is larger than the sum of its proper divisors (287286932921).
2041433404231 is a wasteful number, since it uses less digits than its factorization.
2041433404231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7864 (or 7851 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 2041433404231 its reverse (1324043341402), we get a palindrome (3365476745633).
The spelling of 2041433404231 in words is "two trillion, forty-one billion, four hundred thirty-three million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •