Base | Representation |
---|---|
bin | 1001001110010111111100… |
… | …1011111010101010001111 |
3 | 1022220121200212020122220011 |
4 | 2103211333023322222033 |
5 | 2312133421203204033 |
6 | 33323231320534051 |
7 | 2064526612160602 |
oct | 223457713725217 |
9 | 38817625218804 |
10 | 10142551616143 |
11 | 3260482a76131 |
12 | 1179840021327 |
13 | 58759154c84b |
14 | 270c8b5a6339 |
15 | 128c6eb88ccd |
hex | 9397f2faa8f |
10142551616143 has 4 divisors (see below), whose sum is σ = 10143097432048. Its totient is φ = 10142005800240.
The previous prime is 10142551616111. The next prime is 10142551616227. The reversal of 10142551616143 is 34161615524101.
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 10142551616143 - 25 = 10142551616111 is a prime.
It is a super-2 number, since 2×101425516161432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10142551616096 and 10142551616105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10142551656143) 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, 272880078 + ... + 272917243.
It is an arithmetic number, because the mean of its divisors is an integer number (2535774358012).
Almost surely, 210142551616143 is an apocalyptic number.
10142551616143 is a deficient number, since it is larger than the sum of its proper divisors (545815905).
10142551616143 is an equidigital number, since it uses as much as digits as its factorization.
10142551616143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545815904.
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 10142551616143 in words is "ten trillion, one hundred forty-two billion, five hundred fifty-one million, six hundred sixteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •