Base | Representation |
---|---|
bin | 1011111100101100… |
… | …10000001110010110 |
3 | 121120001110001110120 |
4 | 11332112100032112 |
5 | 101114132331014 |
6 | 2540305532410 |
7 | 314651210061 |
oct | 57626201626 |
9 | 17501401416 |
10 | 6414730134 |
11 | 27a1a4776a |
12 | 12b0344106 |
13 | 7b2c96c07 |
14 | 44bd298d8 |
15 | 27825aba9 |
hex | 17e590396 |
6414730134 has 8 divisors (see below), whose sum is σ = 12829460280. Its totient is φ = 2138243376.
The previous prime is 6414730129. The next prime is 6414730151. The reversal of 6414730134 is 4310374146.
It is a sphenic number, since it is the product of 3 distinct primes.
6414730134 is an admirable number.
It is a super-2 number, since 2×64147301342 = 82297525384095315912, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6414730095 and 6414730104.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 534560839 + ... + 534560850.
It is an arithmetic number, because the mean of its divisors is an integer number (1603682535).
Almost surely, 26414730134 is an apocalyptic number.
6414730134 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6414730134 is a wasteful number, since it uses less digits than its factorization.
6414730134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069121694.
The product of its (nonzero) digits is 24192, while the sum is 33.
The square root of 6414730134 is about 80092.0104255100. The cubic root of 6414730134 is about 1858.0588425791.
The spelling of 6414730134 in words is "six billion, four hundred fourteen million, seven hundred thirty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •