Base | Representation |
---|---|
bin | 1001111010101010100… |
… | …11110010011100000000 |
3 | 1012120111022111201021010 |
4 | 10331111103302130000 |
5 | 21040310304321242 |
6 | 420310401000520 |
7 | 33421461245241 |
oct | 4752523623400 |
9 | 1176438451233 |
10 | 340733667072 |
11 | 1215602aa267 |
12 | 56053023140 |
13 | 26191baa6a6 |
14 | 126c4d2ccc8 |
15 | 8ce37b889c |
hex | 4f554f2700 |
340733667072 has 144 divisors (see below), whose sum is σ = 950531033088. Its totient is φ = 108151296000.
The previous prime is 340733666993. The next prime is 340733667097. The reversal of 340733667072 is 270766337043.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3895822 + ... + 3982322.
It is an arithmetic number, because the mean of its divisors is an integer number (6600909952).
Almost surely, 2340733667072 is an apocalyptic number.
340733667072 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 340733667072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (475265516544).
340733667072 is an abundant number, since it is smaller than the sum of its proper divisors (609797366016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340733667072 is a wasteful number, since it uses less digits than its factorization.
340733667072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86766 (or 86752 counting only the distinct ones).
The product of its (nonzero) digits is 2667168, while the sum is 48.
The spelling of 340733667072 in words is "three hundred forty billion, seven hundred thirty-three million, six hundred sixty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •