Base | Representation |
---|---|
bin | 1001111101111000110… |
… | …11010101110001100110 |
3 | 1012201221212212111101100 |
4 | 10332330123111301212 |
5 | 21102331201400240 |
6 | 421154201340530 |
7 | 33512366264232 |
oct | 4767433256146 |
9 | 1181855774340 |
10 | 342463700070 |
11 | 1222689156a8 |
12 | 56456497746 |
13 | 263a9440c5b |
14 | 1280a9d15c2 |
15 | 8d95600e30 |
hex | 4fbc6d5c66 |
342463700070 has 48 divisors (see below), whose sum is σ = 929118913632. Its totient is φ = 87353059200.
The previous prime is 342463700063. The next prime is 342463700071. The reversal of 342463700070 is 70007364243.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 342463699998 and 342463700034.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (342463700071) 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 23 ways as a sum of consecutive naturals, for example, 82718631 + ... + 82722770.
It is an arithmetic number, because the mean of its divisors is an integer number (19356644034).
Almost surely, 2342463700070 is an apocalyptic number.
342463700070 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
342463700070 is an abundant number, since it is smaller than the sum of its proper divisors (586655213562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
342463700070 is a wasteful number, since it uses less digits than its factorization.
342463700070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165441437 (or 165441434 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 36.
The spelling of 342463700070 in words is "three hundred forty-two billion, four hundred sixty-three million, seven hundred thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •