Base | Representation |
---|---|
bin | 10000000000110… |
… | …100010000000000 |
3 | 200201111210210110 |
4 | 100000310100000 |
5 | 1022233240342 |
6 | 42354031320 |
7 | 6441324420 |
oct | 2000642000 |
9 | 621453713 |
10 | 268649472 |
11 | 128711363 |
12 | 75b78540 |
13 | 438721b0 |
14 | 27972480 |
15 | 188b9c9c |
hex | 10034400 |
268649472 has 264 divisors, whose sum is σ = 910636608. Its totient is φ = 68567040.
The previous prime is 268649471. The next prime is 268649519. The reversal of 268649472 is 274946862.
It is a Harshad number since it is a multiple of its sum of digits (48).
Its product of digits (1161216) is a multiple of the sum of its prime divisors (56).
It is not an unprimeable number, because it can be changed into a prime (268649471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8666097 + ... + 8666127.
Almost surely, 2268649472 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 268649472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (455318304).
268649472 is an abundant number, since it is smaller than the sum of its proper divisors (641987136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268649472 is a wasteful number, since it uses less digits than its factorization.
268649472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105 (or 56 counting only the distinct ones).
The product of its digits is 1161216, while the sum is 48.
The square root of 268649472 is about 16390.5299487234. The cubic root of 268649472 is about 645.2509665763.
The spelling of 268649472 in words is "two hundred sixty-eight million, six hundred forty-nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •