Base | Representation |
---|---|
bin | 111110100101111… |
… | …011011100100110 |
3 | 2201012000010211122 |
4 | 332211323130212 |
5 | 4122313131324 |
6 | 252111533542 |
7 | 35010650060 |
oct | 7645733446 |
9 | 2635003748 |
10 | 1050130214 |
11 | 499853411 |
12 | 25382a2b2 |
13 | 13973c933 |
14 | 9d67a730 |
15 | 622d4a5e |
hex | 3e97b726 |
1050130214 has 8 divisors (see below), whose sum is σ = 1800223248. Its totient is φ = 450055800.
The previous prime is 1050130201. The next prime is 1050130283. The reversal of 1050130214 is 4120310501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10501302142 = 2205546932711371592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050130192 and 1050130201.
It is a congruent number.
It is an unprimeable number.
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, 37504637 + ... + 37504664.
It is an arithmetic number, because the mean of its divisors is an integer number (225027906).
Almost surely, 21050130214 is an apocalyptic number.
1050130214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1050130214 is a deficient number, since it is larger than the sum of its proper divisors (750093034).
1050130214 is an equidigital number, since it uses as much as digits as its factorization.
1050130214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75009310.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 1050130214 is about 32405.7126753910. The cubic root of 1050130214 is about 1016.4383706449.
Adding to 1050130214 its reverse (4120310501), we get a palindrome (5170440715).
The spelling of 1050130214 in words is "one billion, fifty million, one hundred thirty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •