Base | Representation |
---|---|
bin | 111100010101010… |
… | …010010110000010 |
3 | 2121112122202100220 |
4 | 330111102112002 |
5 | 4033111304442 |
6 | 244235123510 |
7 | 34040445444 |
oct | 7425222602 |
9 | 2545582326 |
10 | 1012213122 |
11 | 47a405778 |
12 | 242ba3596 |
13 | 13192519b |
14 | 9860a494 |
15 | 5dce4eec |
hex | 3c552582 |
1012213122 has 8 divisors (see below), whose sum is σ = 2024426256. Its totient is φ = 337404372.
The previous prime is 1012213121. The next prime is 1012213157. The reversal of 1012213122 is 2213122101.
It is a sphenic number, since it is the product of 3 distinct primes.
1012213122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (1012213121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84351088 + ... + 84351099.
It is an arithmetic number, because the mean of its divisors is an integer number (253053282).
Almost surely, 21012213122 is an apocalyptic number.
1012213122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012213122 is a wasteful number, since it uses less digits than its factorization.
1012213122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168702192.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1012213122 is about 31815.2969811693. The cubic root of 1012213122 is about 1004.0545788385.
Adding to 1012213122 its reverse (2213122101), we get a palindrome (3225335223).
It can be divided in two parts, 101 and 2213122, that multiplied together give a palindrome (223525322).
The spelling of 1012213122 in words is "one billion, twelve million, two hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •