Base | Representation |
---|---|
bin | 100111101011000… |
… | …1011101101101110 |
3 | 10102202220201222012 |
4 | 1033112023231232 |
5 | 10211242341324 |
6 | 340032321222 |
7 | 44663066630 |
oct | 11726135556 |
9 | 3382821865 |
10 | 1331215214 |
11 | 62348876a |
12 | 3119a3212 |
13 | 182a47114 |
14 | c8b28a50 |
15 | 7bd0920e |
hex | 4f58bb6e |
1331215214 has 8 divisors (see below), whose sum is σ = 2282083248. Its totient is φ = 570520800.
The previous prime is 1331215213. The next prime is 1331215219. The reversal of 1331215214 is 4125121331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1331215214.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331215213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47543387 + ... + 47543414.
It is an arithmetic number, because the mean of its divisors is an integer number (285260406).
Almost surely, 21331215214 is an apocalyptic number.
1331215214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1331215214 is a deficient number, since it is larger than the sum of its proper divisors (950868034).
1331215214 is an equidigital number, since it uses as much as digits as its factorization.
1331215214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95086810.
The product of its digits is 720, while the sum is 23.
The square root of 1331215214 is about 36485.8220957127. The cubic root of 1331215214 is about 1100.0592844081.
Adding to 1331215214 its reverse (4125121331), we get a palindrome (5456336545).
The spelling of 1331215214 in words is "one billion, three hundred thirty-one million, two hundred fifteen thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •