Base | Representation |
---|---|
bin | 111100010101010… |
… | …010000101000000 |
3 | 2121112122200212112 |
4 | 330111102011000 |
5 | 4033111241112 |
6 | 244235114452 |
7 | 34040442326 |
oct | 7425220500 |
9 | 2545580775 |
10 | 1012212032 |
11 | 47a404977 |
12 | 242ba2a28 |
13 | 131924840 |
14 | 98609d16 |
15 | 5dce4a22 |
hex | 3c552140 |
1012212032 has 28 divisors (see below), whose sum is σ = 2163118356. Its totient is φ = 467174400.
The previous prime is 1012212017. The next prime is 1012212049. The reversal of 1012212032 is 2302122101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 264517696 + 747694336 = 16264^2 + 27344^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1012211998 and 1012212016.
It is a congruent number.
It is an unprimeable number.
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, 607469 + ... + 609132.
It is an arithmetic number, because the mean of its divisors is an integer number (77254227).
Almost surely, 21012212032 is an apocalyptic number.
It is an amenable number.
1012212032 is an abundant number, since it is smaller than the sum of its proper divisors (1150906324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012212032 is a wasteful number, since it uses less digits than its factorization.
1012212032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1216626 (or 1216616 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1012212032 is about 31815.2798510401. The cubic root of 1012212032 is about 1004.0542184336.
Adding to 1012212032 its reverse (2302122101), we get a palindrome (3314334133).
The spelling of 1012212032 in words is "one billion, twelve million, two hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •