Base | Representation |
---|---|
bin | 100000100100010110… |
… | …001001110010010001 |
3 | 10100021002022221122011 |
4 | 200210112021302101 |
5 | 1033104144303033 |
6 | 24021554142521 |
7 | 2345402030035 |
oct | 404426116221 |
9 | 110232287564 |
10 | 34969525393 |
11 | 13915427010 |
12 | 693b281a41 |
13 | 33b3b1397a |
14 | 199a4561c5 |
15 | d9a060ccd |
hex | 824589c91 |
34969525393 has 4 divisors (see below), whose sum is σ = 38148573168. Its totient is φ = 31790477620.
The previous prime is 34969525363. The next prime is 34969525397. The reversal of 34969525393 is 39352596943.
It is a happy number.
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: 39352596943 = 11 ⋅3577508813.
It is not a de Polignac number, because 34969525393 - 233 = 26379590801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (34969525397) 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 3 ways as a sum of consecutive naturals, for example, 1589523871 + ... + 1589523892.
It is an arithmetic number, because the mean of its divisors is an integer number (9537143292).
Almost surely, 234969525393 is an apocalyptic number.
It is an amenable number.
34969525393 is a deficient number, since it is larger than the sum of its proper divisors (3179047775).
34969525393 is a wasteful number, since it uses less digits than its factorization.
34969525393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3179047774.
The product of its digits is 23619600, while the sum is 58.
The spelling of 34969525393 in words is "thirty-four billion, nine hundred sixty-nine million, five hundred twenty-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •