Base | Representation |
---|---|
bin | 10111011010010101… |
… | …00111010111100010 |
3 | 1012102221122011102000 |
4 | 23231022213113202 |
5 | 201220120324344 |
6 | 5435111304430 |
7 | 623320015161 |
oct | 135512472742 |
9 | 35387564360 |
10 | 12568917474 |
11 | 536a90a803 |
12 | 252937b116 |
13 | 1253c99799 |
14 | 8733d33d8 |
15 | 4d869da69 |
hex | 2ed2a75e2 |
12568917474 has 16 divisors (see below), whose sum is σ = 27930927840. Its totient is φ = 4189639140.
The previous prime is 12568917469. The next prime is 12568917509. The reversal of 12568917474 is 47471986521.
12568917474 is a `hidden beast` number, since 1 + 2 + 568 + 9 + 1 + 7 + 4 + 74 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54), and also a Moran number because the ratio is a prime number: 232757731 = 12568917474 / (1 + 2 + 5 + 6 + 8 + 9 + 1 + 7 + 4 + 7 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 12568917474.
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 7 ways as a sum of consecutive naturals, for example, 116378812 + ... + 116378919.
It is an arithmetic number, because the mean of its divisors is an integer number (1745682990).
Almost surely, 212568917474 is an apocalyptic number.
12568917474 is an abundant number, since it is smaller than the sum of its proper divisors (15362010366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12568917474 is a wasteful number, since it uses less digits than its factorization.
12568917474 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232757742 (or 232757736 counting only the distinct ones).
The product of its digits is 3386880, while the sum is 54.
The spelling of 12568917474 in words is "twelve billion, five hundred sixty-eight million, nine hundred seventeen thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •