Base | Representation |
---|---|
bin | 1111100111101110100… |
… | …0011000011011000000 |
3 | 221122200121202000101110 |
4 | 3321323220120123000 |
5 | 13344101202440322 |
6 | 323141152203320 |
7 | 25250156454300 |
oct | 3717350303300 |
9 | 848617660343 |
10 | 268362155712 |
11 | a38a2493652 |
12 | 44015b39540 |
13 | 1c3ca3404a1 |
14 | cdbb391600 |
15 | 6ea9dacc0c |
hex | 3e7ba186c0 |
268362155712 has 504 divisors, whose sum is σ = 862119728640. Its totient is φ = 73442611200.
The previous prime is 268362155701. The next prime is 268362155767. The reversal of 268362155712 is 217551263862.
268362155712 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 71 ways as a sum of consecutive naturals, for example, 1122854089 + ... + 1122854327.
Almost surely, 2268362155712 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 268362155712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (431059864320).
268362155712 is an abundant number, since it is smaller than the sum of its proper divisors (593757572928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268362155712 is a wasteful number, since it uses less digits than its factorization.
268362155712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421 (or 363 counting only the distinct ones).
The product of its digits is 1209600, while the sum is 48.
The spelling of 268362155712 in words is "two hundred sixty-eight billion, three hundred sixty-two million, one hundred fifty-five thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •