Base | Representation |
---|---|
bin | 1000010100001101111110… |
… | …0001100101101010110101 |
3 | 1012101002211002110202010022 |
4 | 2011003133201211222311 |
5 | 2144301231233430401 |
6 | 31240234422534525 |
7 | 1632406660105463 |
oct | 205033741455265 |
9 | 35332732422108 |
10 | 9143440530101 |
11 | 2a057908a0479 |
12 | 1038087897445 |
13 | 5142b84986c7 |
14 | 23878b231833 |
15 | 10cc964ae71b |
hex | 850df865ab5 |
9143440530101 has 4 divisors (see below), whose sum is σ = 9143473510752. Its totient is φ = 9143407549452.
The previous prime is 9143440530041. The next prime is 9143440530121. The reversal of 9143440530101 is 1010350443419.
9143440530101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 9143440530101 - 218 = 9143440267957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9143440530121) 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, 16070915 + ... + 16630128.
It is an arithmetic number, because the mean of its divisors is an integer number (2285868377688).
Almost surely, 29143440530101 is an apocalyptic number.
It is an amenable number.
9143440530101 is a deficient number, since it is larger than the sum of its proper divisors (32980651).
9143440530101 is a wasteful number, since it uses less digits than its factorization.
9143440530101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32980650.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 9143440530101 in words is "nine trillion, one hundred forty-three billion, four hundred forty million, five hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •