Base | Representation |
---|---|
bin | 1010100010111100010001100… |
… | …1011100000101101100001101 |
3 | 10121022120200012120012211002101 |
4 | 2220233010121130011230031 |
5 | 1234232132301331024401 |
6 | 11150154541244155101 |
7 | 312212262121040305 |
oct | 25057043134055415 |
9 | 3538520176184071 |
10 | 742106351033101 |
11 | 1a550459953825a |
12 | 6b295223538a91 |
13 | 25b11436cb5372 |
14 | d1381d3734605 |
15 | 5abdd51249101 |
hex | 2a2f119705b0d |
742106351033101 has 8 divisors (see below), whose sum is σ = 786188808195264. Its totient is φ = 698071576359360.
The previous prime is 742106351032973. The next prime is 742106351033107. The reversal of 742106351033101 is 101330153601247.
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 742106351033101 - 27 = 742106351032973 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 (742106351033107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11920590055 + ... + 11920652308.
It is an arithmetic number, because the mean of its divisors is an integer number (98273601024408).
Almost surely, 2742106351033101 is an apocalyptic number.
It is an amenable number.
742106351033101 is a deficient number, since it is larger than the sum of its proper divisors (44082457162163).
742106351033101 is a wasteful number, since it uses less digits than its factorization.
742106351033101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23841244211.
The product of its (nonzero) digits is 45360, while the sum is 37.
The spelling of 742106351033101 in words is "seven hundred forty-two trillion, one hundred six billion, three hundred fifty-one million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •