Base | Representation |
---|---|
bin | 100100001000001… |
… | …0000001110101011 |
3 | 10010111000011200022 |
4 | 1020100100032223 |
5 | 4440312022311 |
6 | 320142031055 |
7 | 42016463030 |
oct | 11020201653 |
9 | 3114004608 |
10 | 1212220331 |
11 | 5722a3093 |
12 | 299b7848b |
13 | 1641b284a |
14 | b6dd1387 |
15 | 716515db |
hex | 484103ab |
1212220331 has 8 divisors (see below), whose sum is σ = 1385610720. Its totient is φ = 1038883968.
The previous prime is 1212220301. The next prime is 1212220333. The reversal of 1212220331 is 1330222121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1212220331 - 214 = 1212203947 is a prime.
It is a super-2 number, since 2×12122203312 = 2938956261779499122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212220333) 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 7 ways as a sum of consecutive naturals, for example, 65075 + ... + 81603.
It is an arithmetic number, because the mean of its divisors is an integer number (173201340).
Almost surely, 21212220331 is an apocalyptic number.
1212220331 is a deficient number, since it is larger than the sum of its proper divisors (173390389).
1212220331 is a wasteful number, since it uses less digits than its factorization.
1212220331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27013.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1212220331 is about 34816.9546485617. The cubic root of 1212220331 is about 1066.2536262897.
Adding to 1212220331 its reverse (1330222121), we get a palindrome (2542442452).
The spelling of 1212220331 in words is "one billion, two hundred twelve million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •