Base | Representation |
---|---|
bin | 100100000110101… |
… | …0010110001101010 |
3 | 10010102112202012112 |
4 | 1020031102301222 |
5 | 4440112204310 |
6 | 320113242322 |
7 | 42010051445 |
oct | 11015226152 |
9 | 3112482175 |
10 | 1211444330 |
11 | 571913068 |
12 | 2998633a2 |
13 | 163ca0585 |
14 | b6c6c65c |
15 | 7154b705 |
hex | 48352c6a |
1211444330 has 8 divisors (see below), whose sum is σ = 2180599812. Its totient is φ = 484577728.
The previous prime is 1211444321. The next prime is 1211444357. The reversal of 1211444330 is 334441121.
It can be written as a sum of positive squares in 2 ways, for example, as 1195707241 + 15737089 = 34579^2 + 3967^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×12114443303 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211444296 and 1211444305.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 60572207 + ... + 60572226.
Almost surely, 21211444330 is an apocalyptic number.
1211444330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1211444330 is a deficient number, since it is larger than the sum of its proper divisors (969155482).
1211444330 is a wasteful number, since it uses less digits than its factorization.
1211444330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121144440.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 1211444330 is about 34805.8088542703. The cubic root of 1211444330 is about 1066.0260575115.
Adding to 1211444330 its reverse (334441121), we get a palindrome (1545885451).
The spelling of 1211444330 in words is "one billion, two hundred eleven million, four hundred forty-four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •