Base | Representation |
---|---|
bin | 100000001110100000… |
… | …000101110010001101 |
3 | 10022022112201010210102 |
4 | 200032200011302031 |
5 | 1031331334003233 |
6 | 23521343020445 |
7 | 2333331626216 |
oct | 401640056215 |
9 | 108275633712 |
10 | 34603031693 |
11 | 1374756695a |
12 | 685859a725 |
13 | 3355c042a9 |
14 | 19638d440d |
15 | d77cba1e8 |
hex | 80e805c8d |
34603031693 has 2 divisors, whose sum is σ = 34603031694. Its totient is φ = 34603031692.
The previous prime is 34603031689. The next prime is 34603031731. The reversal of 34603031693 is 39613030643.
It is an a-pointer prime, because the next prime (34603031731) can be obtained adding 34603031693 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21198486409 + 13404545284 = 145597^2 + 115778^2 .
It is an emirp because it is prime and its reverse (39613030643) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34603031693 - 22 = 34603031689 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34603031893) 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 as a sum of consecutive naturals, namely, 17301515846 + 17301515847.
It is an arithmetic number, because the mean of its divisors is an integer number (17301515847).
Almost surely, 234603031693 is an apocalyptic number.
It is an amenable number.
34603031693 is a deficient number, since it is larger than the sum of its proper divisors (1).
34603031693 is an equidigital number, since it uses as much as digits as its factorization.
34603031693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 38.
The spelling of 34603031693 in words is "thirty-four billion, six hundred three million, thirty-one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •