Base | Representation |
---|---|
bin | 101110101110011110… |
… | …1011101000011100001 |
3 | 100121000010200022111211 |
4 | 1131130331131003201 |
5 | 3121001012031343 |
6 | 114033005110121 |
7 | 10151420515042 |
oct | 1353475350341 |
9 | 317003608454 |
10 | 100343861473 |
11 | 39612548339 |
12 | 17544b58341 |
13 | 9601b2687b |
14 | 4bdc9b08c9 |
15 | 292450e79d |
hex | 175cf5d0e1 |
100343861473 has 4 divisors (see below), whose sum is σ = 105625117360. Its totient is φ = 95062605588.
The previous prime is 100343861407. The next prime is 100343861489. The reversal of 100343861473 is 374168343001.
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, and also an emirpimes, since its reverse is a distinct semiprime: 374168343001 = 937 ⋅399325873.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100343861473 is a prime.
It is a super-2 number, since 2×1003438614732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100343861873) 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, 2640627915 + ... + 2640627952.
It is an arithmetic number, because the mean of its divisors is an integer number (26406279340).
Almost surely, 2100343861473 is an apocalyptic number.
It is an amenable number.
100343861473 is a deficient number, since it is larger than the sum of its proper divisors (5281255887).
100343861473 is an equidigital number, since it uses as much as digits as its factorization.
100343861473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5281255886.
The product of its (nonzero) digits is 145152, while the sum is 40.
The spelling of 100343861473 in words is "one hundred billion, three hundred forty-three million, eight hundred sixty-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •