Base | Representation |
---|---|
bin | 11110010011110000111… |
… | …01001100010110100001 |
3 | 10200120001011110222002112 |
4 | 33021320131030112201 |
5 | 114030243132114241 |
6 | 2114225224325105 |
7 | 135144636324311 |
oct | 17117035142641 |
9 | 3616034428075 |
10 | 1041403004321 |
11 | 371724934939 |
12 | 1499b7913795 |
13 | 77285c0c174 |
14 | 385930a9441 |
15 | 1c1514d81eb |
hex | f27874c5a1 |
1041403004321 has 2 divisors, whose sum is σ = 1041403004322. Its totient is φ = 1041403004320.
The previous prime is 1041403004311. The next prime is 1041403004363. The reversal of 1041403004321 is 1234003041401.
1041403004321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1002930143296 + 38472861025 = 1001464^2 + 196145^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1041403004321 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1041403004311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520701502160 + 520701502161.
It is an arithmetic number, because the mean of its divisors is an integer number (520701502161).
Almost surely, 21041403004321 is an apocalyptic number.
It is an amenable number.
1041403004321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041403004321 is an equidigital number, since it uses as much as digits as its factorization.
1041403004321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1041403004321 its reverse (1234003041401), we get a palindrome (2275406045722).
The spelling of 1041403004321 in words is "one trillion, forty-one billion, four hundred three million, four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •