Base | Representation |
---|---|
bin | 10100111111010001101… |
… | …000001000011000101101 |
3 | 12002212220112020112011001 |
4 | 110333101220020120231 |
5 | 142112343214034123 |
6 | 3022333035000301 |
7 | 206130210144160 |
oct | 24772150103055 |
9 | 5085815215131 |
10 | 1442331002413 |
11 | 506764281a04 |
12 | 1b3649899091 |
13 | a601b8978b2 |
14 | 4db485d5ad7 |
15 | 277b95de0ad |
hex | 14fd1a0862d |
1442331002413 has 8 divisors (see below), whose sum is σ = 1648398897728. Its totient is φ = 1236268259424.
The previous prime is 1442331002383. The next prime is 1442331002471. The reversal of 1442331002413 is 3142001332441.
It is a happy number.
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 1442331002413 - 25 = 1442331002381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442331000413) 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, 668331 + ... + 1825192.
It is an arithmetic number, because the mean of its divisors is an integer number (206049862216).
Almost surely, 21442331002413 is an apocalyptic number.
It is an amenable number.
1442331002413 is a deficient number, since it is larger than the sum of its proper divisors (206067895315).
1442331002413 is an equidigital number, since it uses as much as digits as its factorization.
1442331002413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2576163.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 1442331002413 its reverse (3142001332441), we get a palindrome (4584332334854).
The spelling of 1442331002413 in words is "one trillion, four hundred forty-two billion, three hundred thirty-one million, two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •