Base | Representation |
---|---|
bin | 100000001110111101… |
… | …000111111100000101 |
3 | 10022100002000211010022 |
4 | 200032331013330011 |
5 | 1031340311031233 |
6 | 23522214104525 |
7 | 2333453415554 |
oct | 401675077405 |
9 | 108302024108 |
10 | 34610642693 |
11 | 13750895140 |
12 | 685b04b145 |
13 | 335766a643 |
14 | 1964915d9b |
15 | d787c0398 |
hex | 80ef47f05 |
34610642693 has 4 divisors (see below), whose sum is σ = 37757064768. Its totient is φ = 31464220620.
The previous prime is 34610642663. The next prime is 34610642701. The reversal of 34610642693 is 39624601643.
34610642693 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 39624601643 = 11 ⋅3602236513.
It is a cyclic number.
It is not a de Polignac number, because 34610642693 - 230 = 33536900869 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 (34610642603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1573211021 + ... + 1573211042.
It is an arithmetic number, because the mean of its divisors is an integer number (9439266192).
Almost surely, 234610642693 is an apocalyptic number.
It is an amenable number.
34610642693 is a deficient number, since it is larger than the sum of its proper divisors (3146422075).
34610642693 is a wasteful number, since it uses less digits than its factorization.
34610642693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3146422074.
The product of its (nonzero) digits is 559872, while the sum is 44.
The spelling of 34610642693 in words is "thirty-four billion, six hundred ten million, six hundred forty-two thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •