Base | Representation |
---|---|
bin | 1001001110011001110101… |
… | …0001101011110010000111 |
3 | 1022220200000001011121021121 |
4 | 2103212131101223302013 |
5 | 2312140434422211201 |
6 | 33323353353054411 |
7 | 2064545252144542 |
oct | 223463521536207 |
9 | 38820001147247 |
10 | 10143056444551 |
11 | 3260711a30198 |
12 | 11799610b7407 |
13 | 587642005594 |
14 | 270cd8657859 |
15 | 128c9e1579a1 |
hex | 9399d46bc87 |
10143056444551 has 8 divisors (see below), whose sum is σ = 10679032313600. Its totient is φ = 9607293654840.
The previous prime is 10143056444539. The next prime is 10143056444579. The reversal of 10143056444551 is 15544465034101.
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 10143056444551 - 217 = 10143056313479 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10143056444498 and 10143056444507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10143056442551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53172111 + ... + 53362528.
It is an arithmetic number, because the mean of its divisors is an integer number (1334879039200).
Almost surely, 210143056444551 is an apocalyptic number.
10143056444551 is a deficient number, since it is larger than the sum of its proper divisors (535975869049).
10143056444551 is a wasteful number, since it uses less digits than its factorization.
10143056444551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106539669.
The product of its (nonzero) digits is 576000, while the sum is 43.
The spelling of 10143056444551 in words is "ten trillion, one hundred forty-three billion, fifty-six million, four hundred forty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •