Base | Representation |
---|---|
bin | 111110100111011… |
… | …101010110001110 |
3 | 2201012202111220111 |
4 | 332213131112032 |
5 | 4122413444324 |
6 | 252124310234 |
7 | 35014240135 |
oct | 7647352616 |
9 | 2635674814 |
10 | 1050531214 |
11 | 499aa7717 |
12 | 2539a237a |
13 | 139850305 |
14 | 9d74291c |
15 | 62363794 |
hex | 3e9dd58e |
1050531214 has 8 divisors (see below), whose sum is σ = 1576059408. Its totient is φ = 525178080.
The previous prime is 1050531211. The next prime is 1050531217. The reversal of 1050531214 is 4121350501.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1050531211) and next prime (1050531217).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10505312142 = 2207231663176627592, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050531211) 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, 27562 + ... + 53485.
It is an arithmetic number, because the mean of its divisors is an integer number (197007426).
Almost surely, 21050531214 is an apocalyptic number.
1050531214 is a deficient number, since it is larger than the sum of its proper divisors (525528194).
1050531214 is an equidigital number, since it uses as much as digits as its factorization.
1050531214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87530.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1050531214 is about 32411.8992655475. The cubic root of 1050531214 is about 1016.5677323537.
Adding to 1050531214 its reverse (4121350501), we get a palindrome (5171881715).
The spelling of 1050531214 in words is "one billion, fifty million, five hundred thirty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •