Base | Representation |
---|---|
bin | 10111010010110011… |
… | …00111101010010000 |
3 | 1012021112202111220110 |
4 | 23221121213222100 |
5 | 201102432220333 |
6 | 5424533241320 |
7 | 621622024056 |
oct | 135131475220 |
9 | 35245674813 |
10 | 12505741968 |
11 | 5338190045 |
12 | 2510193240 |
13 | 1243b7a325 |
14 | 868c6a1d6 |
15 | 4d2d70063 |
hex | 2e9667a90 |
12505741968 has 40 divisors (see below), whose sum is σ = 32378508000. Its totient is φ = 4159289344.
The previous prime is 12505741967. The next prime is 12505741973. The reversal of 12505741968 is 86914750521.
It is a happy number.
12505741968 is digitally balanced in base 2, because in such base 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 not an unprimeable number, because it can be changed into a prime (12505741967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268578 + ... + 311681.
It is an arithmetic number, because the mean of its divisors is an integer number (809462700).
Almost surely, 212505741968 is an apocalyptic number.
It is an amenable number.
12505741968 is an abundant number, since it is smaller than the sum of its proper divisors (19872766032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12505741968 is a wasteful number, since it uses less digits than its factorization.
12505741968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580719 (or 580713 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 48.
The spelling of 12505741968 in words is "twelve billion, five hundred five million, seven hundred forty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •