Base | Representation |
---|---|
bin | 11101001100010011110… |
… | …11010111110001001011 |
3 | 10112220000200101200200112 |
4 | 32212021323113301023 |
5 | 112413212101004121 |
6 | 2044442454424535 |
7 | 132316205262530 |
oct | 16461173276113 |
9 | 3486020350615 |
10 | 1003041422411 |
11 | 357429808636 |
12 | 14249066214b |
13 | 73781424182 |
14 | 36794352d87 |
15 | 1b15878d75b |
hex | e989ed7c4b |
1003041422411 has 8 divisors (see below), whose sum is σ = 1157462502144. Its totient is φ = 851402704680.
The previous prime is 1003041422393. The next prime is 1003041422419. The reversal of 1003041422411 is 1142241403001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1003041422411 is a prime.
It is a super-3 number, since 3×10030414224113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1003041422419) 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 7 ways as a sum of consecutive naturals, for example, 695589725 + ... + 695591166.
It is an arithmetic number, because the mean of its divisors is an integer number (144682812768).
Almost surely, 21003041422411 is an apocalyptic number.
1003041422411 is a deficient number, since it is larger than the sum of its proper divisors (154421079733).
1003041422411 is a wasteful number, since it uses less digits than its factorization.
1003041422411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1391181001.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1003041422411 its reverse (1142241403001), we get a palindrome (2145282825412).
The spelling of 1003041422411 in words is "one trillion, three billion, forty-one million, four hundred twenty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •