Base | Representation |
---|---|
bin | 100000011101101000… |
… | …111011111000011110 |
3 | 10022222020121111201010 |
4 | 200131220323320132 |
5 | 1032341343234140 |
6 | 24002454400050 |
7 | 2342534453661 |
oct | 403550737036 |
9 | 108866544633 |
10 | 34857008670 |
11 | 13867966590 |
12 | 6909660026 |
13 | 3396709c23 |
14 | 19895276d8 |
15 | d90237880 |
hex | 81da3be1e |
34857008670 has 32 divisors (see below), whose sum is σ = 91261987200. Its totient is φ = 8450183840.
The previous prime is 34857008653. The next prime is 34857008689. The reversal of 34857008670 is 7680075843.
It is a super-2 number, since 2×348570086702 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52813320 + ... + 52813979.
It is an arithmetic number, because the mean of its divisors is an integer number (2851937100).
Almost surely, 234857008670 is an apocalyptic number.
34857008670 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
34857008670 is an abundant number, since it is smaller than the sum of its proper divisors (56404978530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34857008670 is a wasteful number, since it uses less digits than its factorization.
34857008670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105627320.
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 34857008670 in words is "thirty-four billion, eight hundred fifty-seven million, eight thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •