Base | Representation |
---|---|
bin | 10110111000100010100110… |
… | …111000001101110011100101 |
3 | 111012100022211000102121022201 |
4 | 112320202212320031303211 |
5 | 101142411241144344331 |
6 | 554014303010054501 |
7 | 30125115212214016 |
oct | 2670424670156345 |
9 | 435308730377281 |
10 | 100642473434341 |
11 | 2a082262567623 |
12 | b35522887a431 |
13 | 4420710413407 |
14 | 1abd19bd5b00d |
15 | b97e1d353a61 |
hex | 5b88a6e0dce5 |
100642473434341 has 8 divisors (see below), whose sum is σ = 101245925721024. Its totient is φ = 100039030704480.
The previous prime is 100642473434333. The next prime is 100642473434407. The reversal of 100642473434341 is 143434374246001.
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 100642473434341 - 23 = 100642473434333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100642473434291 and 100642473434300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100642473434641) 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, 19325746 + ... + 23974348.
It is an arithmetic number, because the mean of its divisors is an integer number (12655740715128).
Almost surely, 2100642473434341 is an apocalyptic number.
It is an amenable number.
100642473434341 is a deficient number, since it is larger than the sum of its proper divisors (603452286683).
100642473434341 is a wasteful number, since it uses less digits than its factorization.
100642473434341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4778411.
The product of its (nonzero) digits is 2322432, while the sum is 46.
The spelling of 100642473434341 in words is "one hundred trillion, six hundred forty-two billion, four hundred seventy-three million, four hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.428 sec. • engine limits •