Base | Representation |
---|---|
bin | 10111110000010010… |
… | …00101000110110000 |
3 | 1012220210010210110100 |
4 | 23320021011012300 |
5 | 202104241024433 |
6 | 5505250232400 |
7 | 631014154452 |
oct | 137011050660 |
9 | 35823123410 |
10 | 12753064368 |
11 | 5454855020 |
12 | 257ab85700 |
13 | 1283193045 |
14 | 88da4a2d2 |
15 | 4e9925b13 |
hex | 2f82451b0 |
12753064368 has 120 divisors (see below), whose sum is σ = 39670385040. Its totient is φ = 3791623680.
The previous prime is 12753064367. The next prime is 12753064397. The reversal of 12753064368 is 86346035721.
12753064368 is a `hidden beast` number, since 1 + 27 + 530 + 64 + 36 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (12753064361) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7998 + ... + 159906.
It is an arithmetic number, because the mean of its divisors is an integer number (330586542).
Almost surely, 212753064368 is an apocalyptic number.
12753064368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12753064368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19835192520).
12753064368 is an abundant number, since it is smaller than the sum of its proper divisors (26917320672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12753064368 is a wasteful number, since it uses less digits than its factorization.
12753064368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151987 (or 151978 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 12753064368 in words is "twelve billion, seven hundred fifty-three million, sixty-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •