Base | Representation |
---|---|
bin | 100100001100000… |
… | …1111111101000000 |
3 | 10010121221122212201 |
4 | 1020120033331000 |
5 | 4441331110402 |
6 | 320255002544 |
7 | 42043342624 |
oct | 11030177500 |
9 | 3117848781 |
10 | 1214316352 |
11 | 5734a4937 |
12 | 29a809454 |
13 | 1647678b2 |
14 | b73b9184 |
15 | 71917687 |
hex | 4860ff40 |
1214316352 has 28 divisors (see below), whose sum is σ = 2468436516. Its totient is φ = 592348160.
The previous prime is 1214316317. The next prime is 1214316359. The reversal of 1214316352 is 2536134121.
It can be written as a sum of positive squares in 2 ways, for example, as 29855296 + 1184461056 = 5464^2 + 34416^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1214316352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1214316359) by changing a digit.
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, 228763 + ... + 234010.
It is an arithmetic number, because the mean of its divisors is an integer number (88158447).
Almost surely, 21214316352 is an apocalyptic number.
It is an amenable number.
1214316352 is an abundant number, since it is smaller than the sum of its proper divisors (1254120164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1214316352 is an equidigital number, since it uses as much as digits as its factorization.
1214316352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462826 (or 462816 counting only the distinct ones).
The product of its digits is 4320, while the sum is 28.
The square root of 1214316352 is about 34847.0422274258. The cubic root of 1214316352 is about 1066.8678169261.
The spelling of 1214316352 in words is "one billion, two hundred fourteen million, three hundred sixteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •