Base | Representation |
---|---|
bin | 110001100111010011… |
… | …0011110000010111111 |
3 | 101012000022222102111110 |
4 | 1203032212132002333 |
5 | 3221201110444033 |
6 | 120540221453103 |
7 | 10461203003151 |
oct | 1431646360277 |
9 | 335008872443 |
10 | 106545406143 |
11 | 41205116670 |
12 | 18795a11193 |
13 | a07c89aa27 |
14 | 522a484ad1 |
15 | 2b88ba9363 |
hex | 18ce99e0bf |
106545406143 has 8 divisors (see below), whose sum is σ = 154975136256. Its totient is φ = 64572973400.
The previous prime is 106545406139. The next prime is 106545406159. The reversal of 106545406143 is 341604545601.
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 106545406143 - 22 = 106545406139 is a prime.
It is a super-2 number, since 2×1065454061432 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106545406343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1614324303 + ... + 1614324368.
It is an arithmetic number, because the mean of its divisors is an integer number (19371892032).
Almost surely, 2106545406143 is an apocalyptic number.
106545406143 is a deficient number, since it is larger than the sum of its proper divisors (48429730113).
106545406143 is a wasteful number, since it uses less digits than its factorization.
106545406143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3228648685.
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 106545406143 in words is "one hundred six billion, five hundred forty-five million, four hundred six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •