Base | Representation |
---|---|
bin | 100100000110000… |
… | …0000000000110010 |
3 | 10010101220112011222 |
4 | 1020030000000302 |
5 | 4440020332310 |
6 | 320102105042 |
7 | 42004140221 |
oct | 11014000062 |
9 | 3111815158 |
10 | 1211105330 |
11 | 5717013a6 |
12 | 29971b182 |
13 | 163bb2196 |
14 | b6bc0cb8 |
15 | 714d1055 |
hex | 48300032 |
1211105330 has 32 divisors (see below), whose sum is σ = 2313695664. Its totient is φ = 454864896.
The previous prime is 1211105327. The next prime is 1211105359. The reversal of 1211105330 is 335011121.
It can be written as a sum of positive squares in 8 ways, for example, as 733813921 + 477291409 = 27089^2 + 21847^2 .
It is a super-2 number, since 2×12111053302 = 2933552240708817800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 1211105299 and 1211105308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65384 + ... + 81836.
Almost surely, 21211105330 is an apocalyptic number.
1211105330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1211105330 is a deficient number, since it is larger than the sum of its proper divisors (1102590334).
1211105330 is a wasteful number, since it uses less digits than its factorization.
1211105330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16910.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 1211105330 is about 34800.9386367667. The cubic root of 1211105330 is about 1065.9266124280.
Adding to 1211105330 its reverse (335011121), we get a palindrome (1546116451).
The spelling of 1211105330 in words is "one billion, two hundred eleven million, one hundred five thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •