Base | Representation |
---|---|
bin | 10011100100000000111… |
… | …010001010101111100011 |
3 | 11202111222100220102221221 |
4 | 103210000322022233203 |
5 | 134011202020341003 |
6 | 2505325315555511 |
7 | 166060666363402 |
oct | 23440072125743 |
9 | 4674870812857 |
10 | 1344340012003 |
11 | 47914998750a |
12 | 1986608bbb97 |
13 | 99a03368331 |
14 | 490d02d7639 |
15 | 24e819467bd |
hex | 13900e8abe3 |
1344340012003 has 8 divisors (see below), whose sum is σ = 1352975044608. Its totient is φ = 1335731672904.
The previous prime is 1344340011991. The next prime is 1344340012007. The reversal of 1344340012003 is 3002100434431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1344340012003 - 221 = 1344337914851 is a prime.
It is a super-3 number, since 3×13443400120033 (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 (1344340012007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6572325 + ... + 6773782.
It is an arithmetic number, because the mean of its divisors is an integer number (169121880576).
Almost surely, 21344340012003 is an apocalyptic number.
1344340012003 is a deficient number, since it is larger than the sum of its proper divisors (8635032605).
1344340012003 is a wasteful number, since it uses less digits than its factorization.
1344340012003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13346753.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 1344340012003 its reverse (3002100434431), we get a palindrome (4346440446434).
The spelling of 1344340012003 in words is "one trillion, three hundred forty-four billion, three hundred forty million, twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •