Base | Representation |
---|---|
bin | 10000000001011011010… |
… | …110110011011110001111 |
3 | 10220020222200011100111200 |
4 | 100001123112303132033 |
5 | 121014414322114211 |
6 | 2201451321120543 |
7 | 142355622256341 |
oct | 20013326633617 |
9 | 3806880140450 |
10 | 1101044332431 |
11 | 394a4a90444a |
12 | 159481629153 |
13 | 7ca9c267c64 |
14 | 3b410075291 |
15 | 1d9924dcb56 |
hex | 1005b5b378f |
1101044332431 has 12 divisors (see below), whose sum is σ = 1590752189208. Its totient is φ = 733865791824.
The previous prime is 1101044332417. The next prime is 1101044332469. The reversal of 1101044332431 is 1342334401011.
It is not a de Polignac number, because 1101044332431 - 27 = 1101044332303 is a prime.
It is a super-2 number, since 2×11010443324312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101044332395 and 1101044332404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101044332331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13604340 + ... + 13685033.
It is an arithmetic number, because the mean of its divisors is an integer number (132562682434).
Almost surely, 21101044332431 is an apocalyptic number.
1101044332431 is a deficient number, since it is larger than the sum of its proper divisors (489707856777).
1101044332431 is a wasteful number, since it uses less digits than its factorization.
1101044332431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27293862 (or 27293859 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1101044332431 its reverse (1342334401011), we get a palindrome (2443378733442).
The spelling of 1101044332431 in words is "one trillion, one hundred one billion, forty-four million, three hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •