Base | Representation |
---|---|
bin | 11101001110011111100… |
… | …10001100010100010011 |
3 | 10120000001100201101221221 |
4 | 32213033302030110103 |
5 | 112423112113440311 |
6 | 2045155042425511 |
7 | 132360226146151 |
oct | 16471762142423 |
9 | 3500040641857 |
10 | 1004213421331 |
11 | 35798032978a |
12 | 142759062297 |
13 | 7390a193463 |
14 | 36865c743d1 |
15 | 1b1c65e7671 |
hex | e9cfc8c513 |
1004213421331 has 2 divisors, whose sum is σ = 1004213421332. Its totient is φ = 1004213421330.
The previous prime is 1004213421313. The next prime is 1004213421401. The reversal of 1004213421331 is 1331243124001.
Together with previous prime (1004213421313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1004213421331 - 231 = 1002065937683 is a prime.
It is a super-2 number, since 2×10042134213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1004213421296 and 1004213421305.
It is not a weakly prime, because it can be changed into another prime (1004213461331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502106710665 + 502106710666.
It is an arithmetic number, because the mean of its divisors is an integer number (502106710666).
Almost surely, 21004213421331 is an apocalyptic number.
1004213421331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004213421331 is an equidigital number, since it uses as much as digits as its factorization.
1004213421331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1004213421331 its reverse (1331243124001), we get a palindrome (2335456545332).
The spelling of 1004213421331 in words is "one trillion, four billion, two hundred thirteen million, four hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •