Base | Representation |
---|---|
bin | 100100000110100… |
… | …1000110010100100 |
3 | 10010102110200002122 |
4 | 1020031020302210 |
5 | 4440104402203 |
6 | 320112325112 |
7 | 42006521264 |
oct | 11015106244 |
9 | 3112420078 |
10 | 1211403428 |
11 | 571895364 |
12 | 299843798 |
13 | 163c87a81 |
14 | b6c5b7a4 |
15 | 7153e538 |
hex | 48348ca4 |
1211403428 has 12 divisors (see below), whose sum is σ = 2193058140. Its totient is φ = 584815392.
The previous prime is 1211403409. The next prime is 1211403467. The reversal of 1211403428 is 8243041121.
It can be written as a sum of positive squares in 2 ways, for example, as 838218304 + 373185124 = 28952^2 + 19318^2 .
It is a super-3 number, since 3×12114034283 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211403397 and 1211403406.
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, 5221451 + ... + 5221682.
It is an arithmetic number, because the mean of its divisors is an integer number (182754845).
Almost surely, 21211403428 is an apocalyptic number.
It is an amenable number.
1211403428 is a deficient number, since it is larger than the sum of its proper divisors (981654712).
1211403428 is a wasteful number, since it uses less digits than its factorization.
1211403428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10443166 (or 10443164 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
The square root of 1211403428 is about 34805.2212749754. The cubic root of 1211403428 is about 1066.0140599624.
Adding to 1211403428 its reverse (8243041121), we get a palindrome (9454444549).
The spelling of 1211403428 in words is "one billion, two hundred eleven million, four hundred three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •