Base | Representation |
---|---|
bin | 1000010001010… |
… | …1111110010101 |
3 | 2102021120212102 |
4 | 2010111332111 |
5 | 32340134023 |
6 | 3235331445 |
7 | 600612545 |
oct | 204257625 |
9 | 72246772 |
10 | 34693013 |
11 | 18646413 |
12 | b750b85 |
13 | 7259114 |
14 | 4871325 |
15 | 30a4628 |
hex | 2115f95 |
34693013 has 8 divisors (see below), whose sum is σ = 35706168. Its totient is φ = 33683904.
The previous prime is 34693007. The next prime is 34693033. The reversal of 34693013 is 31039643.
34693013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 142129 + 34550884 = 377^2 + 5878^2 .
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 34693013 - 26 = 34692949 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 (34693033) 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 7 ways as a sum of consecutive naturals, for example, 27995 + ... + 29207.
It is an arithmetic number, because the mean of its divisors is an integer number (4463271).
Almost surely, 234693013 is an apocalyptic number.
It is an amenable number.
34693013 is a deficient number, since it is larger than the sum of its proper divisors (1013155).
34693013 is a wasteful number, since it uses less digits than its factorization.
34693013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2023.
The product of its (nonzero) digits is 5832, while the sum is 29.
The square root of 34693013 is about 5890.0775037346. The cubic root of 34693013 is about 326.1474642425.
The spelling of 34693013 in words is "thirty-four million, six hundred ninety-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •