Base | Representation |
---|---|
bin | 100110101010010011101100… |
… | …0010101100000100001000000 |
3 | 1122121002000110000120000211010 |
4 | 1031110213120111200201000 |
5 | 324033121142302043011 |
6 | 3203132140401320520 |
7 | 131425655550643311 |
oct | 11524473025404100 |
9 | 1577060400500733 |
10 | 340066255112256 |
11 | 993a031a558012 |
12 | 32183150936140 |
13 | 1179a158307aca |
14 | 5dd941a420608 |
15 | 294ad8500a1a6 |
hex | 13549d8560840 |
340066255112256 has 112 divisors (see below), whose sum is σ = 907129894404096. Its totient is φ = 112427319642624.
The previous prime is 340066255112191. The next prime is 340066255112279. The reversal of 340066255112256 is 652211552660043.
It is a super-2 number, since 2×3400662551122562 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
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, 75022315 + ... + 79425941.
Almost surely, 2340066255112256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 340066255112256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (453564947202048).
340066255112256 is an abundant number, since it is smaller than the sum of its proper divisors (567063639291840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
340066255112256 is a wasteful number, since it uses less digits than its factorization.
340066255112256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4406936 (or 4406926 counting only the distinct ones).
The product of its (nonzero) digits is 2592000, while the sum is 48.
The spelling of 340066255112256 in words is "three hundred forty trillion, sixty-six billion, two hundred fifty-five million, one hundred twelve thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •