Base | Representation |
---|---|
bin | 10100011001111011100… |
… | …100010000100100110111 |
3 | 11222001101222201120000011 |
4 | 110121323210100210313 |
5 | 140433233001104033 |
6 | 2552102055401051 |
7 | 203210425042552 |
oct | 24317344204467 |
9 | 4861358646004 |
10 | 1402232441143 |
11 | 4a0757725376 |
12 | 1a7918983187 |
13 | a22cb286671 |
14 | 4bc22ccd699 |
15 | 2671e138ccd |
hex | 1467b910937 |
1402232441143 has 8 divisors (see below), whose sum is σ = 1463729408640. Its totient is φ = 1341751952640.
The previous prime is 1402232441123. The next prime is 1402232441147. The reversal of 1402232441143 is 3411442322041.
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 a de Polignac number, because none of the positive numbers 2k-1402232441143 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402232441147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254116930 + ... + 254122447.
It is an arithmetic number, because the mean of its divisors is an integer number (182966176080).
Almost surely, 21402232441143 is an apocalyptic number.
1402232441143 is a deficient number, since it is larger than the sum of its proper divisors (61496967497).
1402232441143 is an equidigital number, since it uses as much as digits as its factorization.
1402232441143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508239497.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 1402232441143 its reverse (3411442322041), we get a palindrome (4813674763184).
The spelling of 1402232441143 in words is "one trillion, four hundred two billion, two hundred thirty-two million, four hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •