Base | Representation |
---|---|
bin | 11110000001100001110… |
… | …00011000011000100001 |
3 | 10122121202211102110201102 |
4 | 33000300320120120201 |
5 | 113400220213043340 |
6 | 2105525514244145 |
7 | 134350212223214 |
oct | 17006070303041 |
9 | 3577684373642 |
10 | 1031612237345 |
11 | 368560239788 |
12 | 147b24a26655 |
13 | 7638568c721 |
14 | 37d04a4d77b |
15 | 1bc7bbaa215 |
hex | f030e18621 |
1031612237345 has 16 divisors (see below), whose sum is σ = 1311065653968. Its totient is φ = 776558868480.
The previous prime is 1031612237323. The next prime is 1031612237389. The reversal of 1031612237345 is 5437322161301.
It can be written as a sum of positive squares in 8 ways, for example, as 6812356369 + 1024799880976 = 82537^2 + 1012324^2 .
It is not a de Polignac number, because 1031612237345 - 222 = 1031608043041 is a prime.
It is a super-2 number, since 2×10316122373452 (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 = 1031612237299 and 1031612237308.
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, 1080566 + ... + 1797455.
It is an arithmetic number, because the mean of its divisors is an integer number (81941603373).
Almost surely, 21031612237345 is an apocalyptic number.
It is an amenable number.
1031612237345 is a deficient number, since it is larger than the sum of its proper divisors (279453416623).
1031612237345 is a wasteful number, since it uses less digits than its factorization.
1031612237345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2882260.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 1031612237345 its reverse (5437322161301), we get a palindrome (6468934398646).
The spelling of 1031612237345 in words is "one trillion, thirty-one billion, six hundred twelve million, two hundred thirty-seven thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •