Base | Representation |
---|---|
bin | 11110000001000000010… |
… | …01001001110010010011 |
3 | 10122121001021000112120022 |
4 | 33000200021021302103 |
5 | 113344131320440311 |
6 | 2105442003334055 |
7 | 134340232303511 |
oct | 17004011116223 |
9 | 3577037015508 |
10 | 1031331421331 |
11 | 368426778532 |
12 | 147a6698132b |
13 | 7633c44a7c3 |
14 | 37cb96314b1 |
15 | 1bc621da5db |
hex | f020249c93 |
1031331421331 has 16 divisors (see below), whose sum is σ = 1053344455680. Its totient is φ = 1009613445120.
The previous prime is 1031331421327. The next prime is 1031331421333. The reversal of 1031331421331 is 1331241331301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1031331421331 - 22 = 1031331421327 is a prime.
It is a super-2 number, since 2×10313314213312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1031331421331.
It is not an unprimeable number, because it can be changed into a prime (1031331421333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3181595 + ... + 3490731.
It is an arithmetic number, because the mean of its divisors is an integer number (65834028480).
Almost surely, 21031331421331 is an apocalyptic number.
1031331421331 is a deficient number, since it is larger than the sum of its proper divisors (22013034349).
1031331421331 is a wasteful number, since it uses less digits than its factorization.
1031331421331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309614.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 1031331421331 its reverse (1331241331301), we get a palindrome (2362572752632).
The spelling of 1031331421331 in words is "one trillion, thirty-one billion, three hundred thirty-one million, four hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •