Base | Representation |
---|---|
bin | 100100000101110… |
… | …1011001100001001 |
3 | 10010101202012012010 |
4 | 1020023223030021 |
5 | 4440010120131 |
6 | 320100210133 |
7 | 42003333450 |
oct | 11013531411 |
9 | 3111665163 |
10 | 1211020041 |
11 | 571653310 |
12 | 299699949 |
13 | 163b8240a |
14 | b6b9bb97 |
15 | 714b5b46 |
hex | 482eb309 |
1211020041 has 32 divisors (see below), whose sum is σ = 2131550208. Its totient is φ = 592093440.
The previous prime is 1211020037. The next prime is 1211020061. The reversal of 1211020041 is 1400201121.
It is a happy number.
It is not a de Polignac number, because 1211020041 - 22 = 1211020037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1211019999 and 1211020026.
It is not an unprimeable number, because it can be changed into a prime (1211020021) 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 31 ways as a sum of consecutive naturals, for example, 150265 + ... + 158118.
It is an arithmetic number, because the mean of its divisors is an integer number (66610944).
Almost surely, 21211020041 is an apocalyptic number.
1211020041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1211020041 is a deficient number, since it is larger than the sum of its proper divisors (920530167).
1211020041 is a wasteful number, since it uses less digits than its factorization.
1211020041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308421.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1211020041 is about 34799.7132315771. The cubic root of 1211020041 is about 1065.9015901208.
Adding to 1211020041 its reverse (1400201121), we get a palindrome (2611221162).
The spelling of 1211020041 in words is "one billion, two hundred eleven million, twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •