Base | Representation |
---|---|
bin | 1111100111011111100011… |
… | …11110001011010110100011 |
3 | 11111121002112112202202122012 |
4 | 13303233301332023112203 |
5 | 14000131034210440003 |
6 | 201012351230103135 |
7 | 10143102532154504 |
oct | 763576176132643 |
9 | 144532475682565 |
10 | 34342323140003 |
11 | aa4055212347a |
12 | 3a2793264aaab |
13 | 162160c503698 |
14 | 86a26a76cbab |
15 | 3e84c8d6c8d8 |
hex | 1f3bf1f8b5a3 |
34342323140003 has 8 divisors (see below), whose sum is σ = 34374983731200. Its totient is φ = 34309675433088.
The previous prime is 34342323139909. The next prime is 34342323140017. The reversal of 34342323140003 is 30004132324343.
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 34342323140003 - 210 = 34342323138979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34342323140063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2116553 + ... + 8553621.
It is an arithmetic number, because the mean of its divisors is an integer number (4296872966400).
Almost surely, 234342323140003 is an apocalyptic number.
34342323140003 is a deficient number, since it is larger than the sum of its proper divisors (32660591197).
34342323140003 is a wasteful number, since it uses less digits than its factorization.
34342323140003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6442141.
The product of its (nonzero) digits is 62208, while the sum is 32.
Adding to 34342323140003 its reverse (30004132324343), we get a palindrome (64346455464346).
The spelling of 34342323140003 in words is "thirty-four trillion, three hundred forty-two billion, three hundred twenty-three million, one hundred forty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •