Base | Representation |
---|---|
bin | 10100011010111101001… |
… | …111101000101101101001 |
3 | 11222011020210010101001112 |
4 | 110122331033220231221 |
5 | 140443012042044431 |
6 | 2552403301000105 |
7 | 203246635000253 |
oct | 24327517505551 |
9 | 4864223111045 |
10 | 1403334331241 |
11 | 4a1172710747 |
12 | 1a7b859b3035 |
13 | a244564973b |
14 | 4bcc93a0cd3 |
15 | 26785c44c2b |
hex | 146bd3e8b69 |
1403334331241 has 16 divisors (see below), whose sum is σ = 1435864434048. Its totient is φ = 1371186835200.
The previous prime is 1403334331213. The next prime is 1403334331247. The reversal of 1403334331241 is 1421334333041.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1403334331241 - 26 = 1403334331177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1403334331198 and 1403334331207.
It is not an unprimeable number, because it can be changed into a prime (1403334331247) 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 in 15 ways as a sum of consecutive naturals, for example, 6941201 + ... + 7140513.
It is an arithmetic number, because the mean of its divisors is an integer number (89741527128).
Almost surely, 21403334331241 is an apocalyptic number.
It is an amenable number.
1403334331241 is a deficient number, since it is larger than the sum of its proper divisors (32530102807).
1403334331241 is a wasteful number, since it uses less digits than its factorization.
1403334331241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200272.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 1403334331241 its reverse (1421334333041), we get a palindrome (2824668664282).
The spelling of 1403334331241 in words is "one trillion, four hundred three billion, three hundred thirty-four million, three hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •