Base | Representation |
---|---|
bin | 10110110111000111… |
… | …11100101101100000 |
3 | 1011200100212212221010 |
4 | 23123203330231200 |
5 | 200114013143413 |
6 | 5345521100520 |
7 | 613102416600 |
oct | 133343745540 |
9 | 34610785833 |
10 | 12273568608 |
11 | 5229122834 |
12 | 2466487740 |
13 | 1207a39a42 |
14 | 8460b0c00 |
15 | 4bc7acdc3 |
hex | 2db8fcb60 |
12273568608 has 288 divisors, whose sum is σ = 40971184128. Its totient is φ = 3193344000.
The previous prime is 12273568487. The next prime is 12273568609. The reversal of 12273568608 is 80686537221.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12273568609) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 2476533 + ... + 2481483.
It is an arithmetic number, because the mean of its divisors is an integer number (142261056).
Almost surely, 212273568608 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 12273568608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20485592064).
12273568608 is an abundant number, since it is smaller than the sum of its proper divisors (28697615520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12273568608 is a wasteful number, since it uses less digits than its factorization.
12273568608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5026 (or 5011 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 12273568608 in words is "twelve billion, two hundred seventy-three million, five hundred sixty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •