Base | Representation |
---|---|
bin | 10010111100110011110… |
… | …011000101011010100111 |
3 | 11121111022122001120110021 |
4 | 102330303303011122213 |
5 | 132313443443321411 |
6 | 2434124230540011 |
7 | 163040552246065 |
oct | 22746363053247 |
9 | 4544278046407 |
10 | 1302244120231 |
11 | 462307946a0a |
12 | 190472b07607 |
13 | 95a55005b32 |
14 | 4705962d035 |
15 | 23d1ae59a71 |
hex | 12f33cc56a7 |
1302244120231 has 2 divisors, whose sum is σ = 1302244120232. Its totient is φ = 1302244120230.
The previous prime is 1302244120217. The next prime is 1302244120249. The reversal of 1302244120231 is 1320214422031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1302244120231 - 27 = 1302244120103 is a prime.
It is a super-2 number, since 2×13022441202312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1302244120196 and 1302244120205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302244120211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651122060115 + 651122060116.
It is an arithmetic number, because the mean of its divisors is an integer number (651122060116).
Almost surely, 21302244120231 is an apocalyptic number.
1302244120231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302244120231 is an equidigital number, since it uses as much as digits as its factorization.
1302244120231 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 1302244120231 its reverse (1320214422031), we get a palindrome (2622458542262).
The spelling of 1302244120231 in words is "one trillion, three hundred two billion, two hundred forty-four million, one hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.714 sec. • engine limits •