Base | Representation |
---|---|
bin | 1001011101011111100110… |
… | …0101010111000011001111 |
3 | 1100211110011101120110122010 |
4 | 2113113321211113003033 |
5 | 2330412404101103033 |
6 | 34042430241352303 |
7 | 2122353524553261 |
oct | 227277145270317 |
9 | 40743141513563 |
10 | 10402303144143 |
11 | 3350656a34729 |
12 | 1200052338693 |
13 | 5a5c1899cb41 |
14 | 27d68d13bb31 |
15 | 1308c3b2e863 |
hex | 975f99570cf |
10402303144143 has 8 divisors (see below), whose sum is σ = 13881787693056. Its totient is φ = 6928843679000.
The previous prime is 10402303144063. The next prime is 10402303144147. The reversal of 10402303144143 is 34144130320401.
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 10402303144143 - 28 = 10402303143887 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10402303144143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10402303144147) 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, 1506266913 + ... + 1506273818.
It is an arithmetic number, because the mean of its divisors is an integer number (1735223461632).
Almost surely, 210402303144143 is an apocalyptic number.
10402303144143 is a deficient number, since it is larger than the sum of its proper divisors (3479484548913).
10402303144143 is a wasteful number, since it uses less digits than its factorization.
10402303144143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3012541885.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 10402303144143 its reverse (34144130320401), we get a palindrome (44546433464544).
The spelling of 10402303144143 in words is "ten trillion, four hundred two billion, three hundred three million, one hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •