Base | Representation |
---|---|
bin | 11110000000011011100… |
… | …01000000110101100011 |
3 | 10122120020202212100210010 |
4 | 33000031301000311203 |
5 | 113343013403301311 |
6 | 2105351231140003 |
7 | 134326466531304 |
oct | 17001561006543 |
9 | 3576222770703 |
10 | 1031023103331 |
11 | 368288732671 |
12 | 14799b674603 |
13 | 762c05c9910 |
14 | 37c8a6d47ab |
15 | 1bc450d6da6 |
hex | f00dc40d63 |
1031023103331 has 32 divisors (see below), whose sum is σ = 1600880053248. Its totient is φ = 584448238080.
The previous prime is 1031023103311. The next prime is 1031023103347. The reversal of 1031023103331 is 1333013201301.
It is not a de Polignac number, because 1031023103331 - 215 = 1031023070563 is a prime.
It is a super-2 number, since 2×10310231033312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031023103298 and 1031023103307.
It is not an unprimeable number, because it can be changed into a prime (1031023103311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16512325 + ... + 16574646.
It is an arithmetic number, because the mean of its divisors is an integer number (50027501664).
Almost surely, 21031023103331 is an apocalyptic number.
1031023103331 is a deficient number, since it is larger than the sum of its proper divisors (569856949917).
1031023103331 is a wasteful number, since it uses less digits than its factorization.
1031023103331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33087051.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1031023103331 its reverse (1333013201301), we get a palindrome (2364036304632).
The spelling of 1031023103331 in words is "one trillion, thirty-one billion, twenty-three million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •