Base | Representation |
---|---|
bin | 11101001011001100101… |
… | …01101100011101100111 |
3 | 10112211111001212220220120 |
4 | 32211212111230131213 |
5 | 112411001222440033 |
6 | 2044303325133023 |
7 | 132265335216615 |
oct | 16454625543547 |
9 | 3484431786816 |
10 | 1002444343143 |
11 | 3571527750a1 |
12 | 1423446ba173 |
13 | 736b780bb29 |
14 | 36738d2a6b5 |
15 | 1b12114b1b3 |
hex | e96656c767 |
1002444343143 has 8 divisors (see below), whose sum is σ = 1336647929328. Its totient is φ = 668268492864.
The previous prime is 1002444343141. The next prime is 1002444343163. The reversal of 1002444343143 is 3413434442001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1002444343143 - 21 = 1002444343141 is a prime.
It is a super-2 number, since 2×10024443431432 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002444343141) 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, 6849496 + ... + 6994317.
It is an arithmetic number, because the mean of its divisors is an integer number (167080991166).
Almost surely, 21002444343143 is an apocalyptic number.
1002444343143 is a deficient number, since it is larger than the sum of its proper divisors (334203586185).
1002444343143 is a wasteful number, since it uses less digits than its factorization.
1002444343143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13867953.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 1002444343143 its reverse (3413434442001), we get a palindrome (4415878785144).
The spelling of 1002444343143 in words is "one trillion, two billion, four hundred forty-four million, three hundred forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •