Base | Representation |
---|---|
bin | 100000001000001… |
… | …0110001111001100 |
3 | 2210010111110022210 |
4 | 1000100112033030 |
5 | 4201433332322 |
6 | 254545510420 |
7 | 35500036323 |
oct | 10020261714 |
9 | 2703443283 |
10 | 1078027212 |
11 | 503577889 |
12 | 261042410 |
13 | 142459632 |
14 | a325d0ba |
15 | 6499570c |
hex | 404163cc |
1078027212 has 12 divisors (see below), whose sum is σ = 2515396856. Its totient is φ = 359342400.
The previous prime is 1078027199. The next prime is 1078027213. The reversal of 1078027212 is 2127208701.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 1078027212.
It is not an unprimeable number, because it can be changed into a prime (1078027213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44917789 + ... + 44917812.
Almost surely, 21078027212 is an apocalyptic number.
1078027212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1078027212 is an abundant number, since it is smaller than the sum of its proper divisors (1437369644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1078027212 is a wasteful number, since it uses less digits than its factorization.
1078027212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89835608 (or 89835606 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 30.
The square root of 1078027212 is about 32833.3247174270. The cubic root of 1078027212 is about 1025.3604798319.
The spelling of 1078027212 in words is "one billion, seventy-eight million, twenty-seven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •