Base | Representation |
---|---|
bin | 1001100110010001111011… |
… | …0001110010010111111111 |
3 | 1101100212210012121202200222 |
4 | 2121210132301302113333 |
5 | 2340401024224423033 |
6 | 34240032510211555 |
7 | 2136306253360025 |
oct | 231443661622777 |
9 | 41325705552628 |
10 | 10553251014143 |
11 | 33a9677090612 |
12 | 122535a4b3bbb |
13 | 5b7223736706 |
14 | 286acc74a715 |
15 | 1347aaa44598 |
hex | 9991ec725ff |
10553251014143 has 4 divisors (see below), whose sum is σ = 10578437771160. Its totient is φ = 10528064257128.
The previous prime is 10553251014133. The next prime is 10553251014149. The reversal of 10553251014143 is 34141015235501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10553251014143 - 28 = 10553251013887 is a prime.
It is a super-2 number, since 2×105532510141432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10553251014149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12593377880 + ... + 12593378717.
It is an arithmetic number, because the mean of its divisors is an integer number (2644609442790).
Almost surely, 210553251014143 is an apocalyptic number.
10553251014143 is a deficient number, since it is larger than the sum of its proper divisors (25186757017).
10553251014143 is an equidigital number, since it uses as much as digits as its factorization.
10553251014143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25186757016.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 10553251014143 its reverse (34141015235501), we get a palindrome (44694266249644).
The spelling of 10553251014143 in words is "ten trillion, five hundred fifty-three billion, two hundred fifty-one million, fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •