Base | Representation |
---|---|
bin | 10111110010101100… |
… | …10001101010101000 |
3 | 1012222012012220202200 |
4 | 23321112101222220 |
5 | 202124431112104 |
6 | 5511252100200 |
7 | 631351160220 |
oct | 137126215250 |
9 | 35865186680 |
10 | 12773300904 |
11 | 5465217031 |
12 | 2585904660 |
13 | 128742a020 |
14 | 8925d7080 |
15 | 4eb5c1b39 |
hex | 2f9591aa8 |
12773300904 has 96 divisors (see below), whose sum is σ = 42577691520. Its totient is φ = 3368780928.
The previous prime is 12773300849. The next prime is 12773300909. The reversal of 12773300904 is 40900337721.
12773300904 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 (36).
It is not an unprimeable number, because it can be changed into a prime (12773300909) 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 23 ways as a sum of consecutive naturals, for example, 968212 + ... + 981315.
It is an arithmetic number, because the mean of its divisors is an integer number (443517620).
Almost surely, 212773300904 is an apocalyptic number.
12773300904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
12773300904 is an abundant number, since it is smaller than the sum of its proper divisors (29804390616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12773300904 is a wasteful number, since it uses less digits than its factorization.
12773300904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1949559 (or 1949552 counting only the distinct ones).
The product of its (nonzero) digits is 31752, while the sum is 36.
The spelling of 12773300904 in words is "twelve billion, seven hundred seventy-three million, three hundred thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •