Base | Representation |
---|---|
bin | 100111000101001110100011… |
… | …0111010001100011000100110 |
3 | 1200002011201022222021221201210 |
4 | 1032022131012322030120212 |
5 | 330024230411212032432 |
6 | 3215043542230132250 |
7 | 132260164566440103 |
oct | 11612350672143046 |
9 | 1602151288257653 |
10 | 343766077064742 |
11 | 9a5974135a3682 |
12 | 326802037b1086 |
13 | 119a8004435687 |
14 | 60c651cb11aaa |
15 | 29b2227d868cc |
hex | 138a746e8c626 |
343766077064742 has 8 divisors (see below), whose sum is σ = 687532154129496. Its totient is φ = 114588692354912.
The previous prime is 343766077064737. The next prime is 343766077064743. The reversal of 343766077064742 is 247460770667343.
It is a sphenic number, since it is the product of 3 distinct primes.
343766077064742 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343766077064743) 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 3 ways as a sum of consecutive naturals, for example, 28647173088723 + ... + 28647173088734.
It is an arithmetic number, because the mean of its divisors is an integer number (85941519266187).
Almost surely, 2343766077064742 is an apocalyptic number.
343766077064742 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
343766077064742 is a wasteful number, since it uses less digits than its factorization.
343766077064742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57294346177462.
The product of its (nonzero) digits is 597445632, while the sum is 66.
The spelling of 343766077064742 in words is "three hundred forty-three trillion, seven hundred sixty-six billion, seventy-seven million, sixty-four thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •