Base | Representation |
---|---|
bin | 10000011101101101111… |
… | …101000001100000001001 |
3 | 11000011101200102122201211 |
4 | 100131231331001200021 |
5 | 122014122301043304 |
6 | 2223433453013121 |
7 | 144512445530014 |
oct | 20355575014011 |
9 | 4004350378654 |
10 | 1131421112329 |
11 | 3a69187a3822 |
12 | 16333a7841a1 |
13 | 82900701631 |
14 | 3ca9255c37b |
15 | 1e66e240204 |
hex | 1076df41809 |
1131421112329 has 2 divisors, whose sum is σ = 1131421112330. Its totient is φ = 1131421112328.
The previous prime is 1131421112317. The next prime is 1131421112443. The reversal of 1131421112329 is 9232111241311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 598995506704 + 532425605625 = 773948^2 + 729675^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131421112329 is a prime.
It is a super-2 number, since 2×11314211123292 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1131421112329.
It is not a weakly prime, because it can be changed into another prime (1131421112729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565710556164 + 565710556165.
It is an arithmetic number, because the mean of its divisors is an integer number (565710556165).
Almost surely, 21131421112329 is an apocalyptic number.
It is an amenable number.
1131421112329 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131421112329 is an equidigital number, since it uses as much as digits as its factorization.
1131421112329 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 31.
The spelling of 1131421112329 in words is "one trillion, one hundred thirty-one billion, four hundred twenty-one million, one hundred twelve thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •