Base | Representation |
---|---|
bin | 1001111001110011011… |
… | …11011010010010000000 |
3 | 1012112022002012012210012 |
4 | 10330321233122102000 |
5 | 21033333403133422 |
6 | 420152435324052 |
7 | 33404144006522 |
oct | 4747157322200 |
9 | 1175262165705 |
10 | 340271146112 |
11 | 121343211437 |
12 | 55b44150628 |
13 | 2611a118851 |
14 | 1267d731a12 |
15 | 8cb7da54e2 |
hex | 4f39bda480 |
340271146112 has 32 divisors (see below), whose sum is σ = 690674200380. Its totient is φ = 166925464576.
The previous prime is 340271146067. The next prime is 340271146133. The reversal of 340271146112 is 211641172043.
It can be written as a sum of positive squares in 2 ways, for example, as 337765542976 + 2505603136 = 581176^2 + 50056^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (32).
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 3 ways as a sum of consecutive naturals, for example, 25072163 + ... + 25085730.
Almost surely, 2340271146112 is an apocalyptic number.
340271146112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
340271146112 is an abundant number, since it is smaller than the sum of its proper divisors (350403054268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340271146112 is an equidigital number, since it uses as much as digits as its factorization.
340271146112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50157960 (or 50157948 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 32.
The spelling of 340271146112 in words is "three hundred forty billion, two hundred seventy-one million, one hundred forty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •