Base | Representation |
---|---|
bin | 10001100001100111001… |
… | …100110000011010000011 |
3 | 11021010120021202122210021 |
4 | 101201213030300122003 |
5 | 124212422443141011 |
6 | 2321131421114311 |
7 | 153003141065143 |
oct | 21414714603203 |
9 | 4233507678707 |
10 | 1204322240131 |
11 | 42482856507a |
12 | 1754a50b8997 |
13 | 8974abc314a |
14 | 4240a5a0923 |
15 | 214d93b4471 |
hex | 11867330683 |
1204322240131 has 2 divisors, whose sum is σ = 1204322240132. Its totient is φ = 1204322240130.
The previous prime is 1204322240117. The next prime is 1204322240137. The reversal of 1204322240131 is 1310422234021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1204322240131 - 213 = 1204322231939 is a prime.
It is a super-2 number, since 2×12043222401312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1204322240096 and 1204322240105.
It is not a weakly prime, because it can be changed into another prime (1204322240137) 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 as a sum of consecutive naturals, namely, 602161120065 + 602161120066.
It is an arithmetic number, because the mean of its divisors is an integer number (602161120066).
Almost surely, 21204322240131 is an apocalyptic number.
1204322240131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1204322240131 is an equidigital number, since it uses as much as digits as its factorization.
1204322240131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1204322240131 its reverse (1310422234021), we get a palindrome (2514744474152).
The spelling of 1204322240131 in words is "one trillion, two hundred four billion, three hundred twenty-two million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •