Base | Representation |
---|---|
bin | 100000000001101010… |
… | …001100001110010101 |
3 | 10021202112021211201212 |
4 | 200001222030032111 |
5 | 1030411204410301 |
6 | 23444125031205 |
7 | 2325104366513 |
oct | 400152141625 |
9 | 107675254655 |
10 | 34387575701 |
11 | 13646987656 |
12 | 67b83b5505 |
13 | 3320397c3b |
14 | 194304b4b3 |
15 | d63e0b4bb |
hex | 801a8c395 |
34387575701 has 6 divisors (see below), whose sum is σ = 35947693110. Its totient is φ = 32892463208.
The previous prime is 34387575661. The next prime is 34387575731. The reversal of 34387575701 is 10757578343.
It can be written as a sum of positive squares in only one way, i.e., 34382801476 + 4774225 = 185426^2 + 2185^2 .
It is not a de Polignac number, because 34387575701 - 222 = 34383381397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 34387575701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34387575731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32501906 + ... + 32502963.
It is an arithmetic number, because the mean of its divisors is an integer number (5991282185).
Almost surely, 234387575701 is an apocalyptic number.
It is an amenable number.
34387575701 is a deficient number, since it is larger than the sum of its proper divisors (1560117409).
34387575701 is an equidigital number, since it uses as much as digits as its factorization.
34387575701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65004915 (or 65004892 counting only the distinct ones).
The product of its (nonzero) digits is 2469600, while the sum is 50.
The spelling of 34387575701 in words is "thirty-four billion, three hundred eighty-seven million, five hundred seventy-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •