Base | Representation |
---|---|
bin | 110001001001110001… |
… | …1010001111010000011 |
3 | 101002110021211001200212 |
4 | 1202103203101322003 |
5 | 3212134001323433 |
6 | 120254031504335 |
7 | 10424513160446 |
oct | 1422343217203 |
9 | 332407731625 |
10 | 105554714243 |
11 | 40846980130 |
12 | 1855a0880ab |
13 | 9c5256c4c4 |
14 | 5174a7b65d |
15 | 2b2bc15d48 |
hex | 18938d1e83 |
105554714243 has 8 divisors (see below), whose sum is σ = 115152957936. Its totient is φ = 95956864000.
The previous prime is 105554714171. The next prime is 105554714323. The reversal of 105554714243 is 342417455501.
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 105554714243 - 28 = 105554713987 is a prime.
It is a super-2 number, since 2×1055547142432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105554714243.
It is not an unprimeable number, because it can be changed into a prime (105554711243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 931043 + ... + 1038243.
It is an arithmetic number, because the mean of its divisors is an integer number (14394119742).
Almost surely, 2105554714243 is an apocalyptic number.
105554714243 is a deficient number, since it is larger than the sum of its proper divisors (9598243693).
105554714243 is a wasteful number, since it uses less digits than its factorization.
105554714243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196725.
The product of its (nonzero) digits is 336000, while the sum is 41.
The spelling of 105554714243 in words is "one hundred five billion, five hundred fifty-four million, seven hundred fourteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •