Base | Representation |
---|---|
bin | 111100010001100… |
… | …000001000010101 |
3 | 2121110210100110010 |
4 | 330101200020111 |
5 | 4032333033023 |
6 | 244201550433 |
7 | 34026144135 |
oct | 7421401025 |
9 | 2543710403 |
10 | 1011221013 |
11 | 479898350 |
12 | 2427a5419 |
13 | 13166873a |
14 | 9842cac5 |
15 | 5db9b093 |
hex | 3c460215 |
1011221013 has 64 divisors (see below), whose sum is σ = 1642291200. Its totient is φ = 545909760.
The previous prime is 1011221011. The next prime is 1011221033. The reversal of 1011221013 is 3101221101.
It is not a de Polignac number, because 1011221013 - 21 = 1011221011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011221013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011221011) 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 63 ways as a sum of consecutive naturals, for example, 1406068 + ... + 1406786.
It is an arithmetic number, because the mean of its divisors is an integer number (25660800).
Almost surely, 21011221013 is an apocalyptic number.
It is an amenable number.
1011221013 is a deficient number, since it is larger than the sum of its proper divisors (631070187).
1011221013 is a wasteful number, since it uses less digits than its factorization.
1011221013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 882.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1011221013 is about 31799.7014608628. The cubic root of 1011221013 is about 1003.7264341067.
Adding to 1011221013 its reverse (3101221101), we get a palindrome (4112442114).
It can be divided in two parts, 10112 and 21013, that added together give a triangular number (31125 = T249).
The spelling of 1011221013 in words is "one billion, eleven million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •