Base | Representation |
---|---|
bin | 100100001011111… |
… | …1111111000100010 |
3 | 10010121211022120212 |
4 | 1020113333320202 |
5 | 4441322004110 |
6 | 320253334122 |
7 | 42042650003 |
oct | 11027777042 |
9 | 3117738525 |
10 | 1214250530 |
11 | 57345a439 |
12 | 29a797342 |
13 | 16474394c |
14 | b739d1aa |
15 | 71902e05 |
hex | 485ffe22 |
1214250530 has 8 divisors (see below), whose sum is σ = 2185650972. Its totient is φ = 485700208.
The previous prime is 1214250529. The next prime is 1214250533. The reversal of 1214250530 is 350524121.
It can be written as a sum of positive squares in 2 ways, for example, as 1192804369 + 21446161 = 34537^2 + 4631^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1214250496 and 1214250505.
It is not an unprimeable number, because it can be changed into a prime (1214250533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60712517 + ... + 60712536.
Almost surely, 21214250530 is an apocalyptic number.
1214250530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1214250530 is a deficient number, since it is larger than the sum of its proper divisors (971400442).
1214250530 is a wasteful number, since it uses less digits than its factorization.
1214250530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121425060.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1214250530 is about 34846.0977729214. The cubic root of 1214250530 is about 1066.8485400597.
Adding to 1214250530 its reverse (350524121), we get a palindrome (1564774651).
The spelling of 1214250530 in words is "one billion, two hundred fourteen million, two hundred fifty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •