Base | Representation |
---|---|
bin | 10100010011010… |
… | …101011010100010 |
3 | 212201220220212210 |
4 | 110103111122202 |
5 | 1144144102040 |
6 | 53444302550 |
7 | 11304106101 |
oct | 2423253242 |
9 | 781826783 |
10 | 340612770 |
11 | 1652a3463 |
12 | 960a1a56 |
13 | 5574a524 |
14 | 33346038 |
15 | 1ed82480 |
hex | 144d56a2 |
340612770 has 16 divisors (see below), whose sum is σ = 817470720. Its totient is φ = 90830064.
The previous prime is 340612759. The next prime is 340612781. The reversal of 340612770 is 77216043.
It is an interprime number because it is at equal distance from previous prime (340612759) and next prime (340612781).
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 11353759 = 340612770 / (3 + 4 + 0 + 6 + 1 + 2 + 7 + 7 + 0).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 5676850 + ... + 5676909.
It is an arithmetic number, because the mean of its divisors is an integer number (51091920).
Almost surely, 2340612770 is an apocalyptic number.
340612770 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
340612770 is an abundant number, since it is smaller than the sum of its proper divisors (476857950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340612770 is a wasteful number, since it uses less digits than its factorization.
340612770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11353769.
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 340612770 is about 18455.6974942699. The cubic root of 340612770 is about 698.3722518560.
The spelling of 340612770 in words is "three hundred forty million, six hundred twelve thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •