Base | Representation |
---|---|
bin | 100000010000100001… |
… | …010111111001111101 |
3 | 10022101220110222020020 |
4 | 200100201113321331 |
5 | 1031414023004433 |
6 | 23524553242353 |
7 | 2334222661215 |
oct | 402041277175 |
9 | 108356428206 |
10 | 34636922493 |
11 | 13764704588 |
12 | 6867a033b9 |
13 | 335cc3c214 |
14 | 19681d7245 |
15 | d7ac61cb3 |
hex | 810857e7d |
34636922493 has 8 divisors (see below), whose sum is σ = 48899184768. Its totient is φ = 21732970944.
The previous prime is 34636922413. The next prime is 34636922539. The reversal of 34636922493 is 39422963643.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 34636922493 - 28 = 34636922237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51), and also a Moran number because the ratio is a prime number: 679155343 = 34636922493 / (3 + 4 + 6 + 3 + 6 + 9 + 2 + 2 + 4 + 9 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34636922413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 339577621 + ... + 339577722.
It is an arithmetic number, because the mean of its divisors is an integer number (6112398096).
Almost surely, 234636922493 is an apocalyptic number.
It is an amenable number.
34636922493 is a deficient number, since it is larger than the sum of its proper divisors (14262262275).
34636922493 is a wasteful number, since it uses less digits than its factorization.
34636922493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679155363.
The product of its digits is 5038848, while the sum is 51.
The spelling of 34636922493 in words is "thirty-four billion, six hundred thirty-six million, nine hundred twenty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •