Base | Representation |
---|---|
bin | 111100010100111… |
… | …011110111011010 |
3 | 2121112111002001211 |
4 | 330110323313122 |
5 | 4033100333200 |
6 | 244233133334 |
7 | 34036613143 |
oct | 7424736732 |
9 | 2545432054 |
10 | 1012121050 |
11 | 47a352586 |
12 | 242b5a24a |
13 | 1318c22c5 |
14 | 985c4aca |
15 | 5dcc7aba |
hex | 3c53bdda |
1012121050 has 24 divisors (see below), whose sum is σ = 1886291100. Its totient is φ = 404042880.
The previous prime is 1012121029. The next prime is 1012121053. The reversal of 1012121050 is 501212101.
It can be written as a sum of positive squares in 6 ways, for example, as 331276401 + 680844649 = 18201^2 + 26093^2 .
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 1012121050.
It is not an unprimeable number, because it can be changed into a prime (1012121053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5566 + ... + 45334.
Almost surely, 21012121050 is an apocalyptic number.
1012121050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012121050 is a deficient number, since it is larger than the sum of its proper divisors (874170050).
1012121050 is a wasteful number, since it uses less digits than its factorization.
1012121050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40290 (or 40285 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 1012121050 is about 31813.8499713568. The cubic root of 1012121050 is about 1004.0241346187.
Adding to 1012121050 its reverse (501212101), we get a palindrome (1513333151).
The spelling of 1012121050 in words is "one billion, twelve million, one hundred twenty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •