Base | Representation |
---|---|
bin | 101101100111001… |
… | …1100001011110010 |
3 | 10221122221001220212 |
4 | 1123032130023302 |
5 | 11113302341424 |
6 | 411512104122 |
7 | 52633065305 |
oct | 13316341362 |
9 | 3848831825 |
10 | 1530512114 |
11 | 715a3044a |
12 | 368695042 |
13 | 1b5116391 |
14 | 1073a6b3c |
15 | 8e57510e |
hex | 5b39c2f2 |
1530512114 has 4 divisors (see below), whose sum is σ = 2295768174. Its totient is φ = 765256056.
The previous prime is 1530512107. The next prime is 1530512119. The reversal of 1530512114 is 4112150351.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1359765625 + 170746489 = 36875^2 + 13067^2 .
It is a super-2 number, since 2×15305121142 = 4684934662201497992, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1530512114.
It is not an unprimeable number, because it can be changed into a prime (1530512119) 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 as a sum of consecutive naturals, namely, 382628027 + ... + 382628030.
Almost surely, 21530512114 is an apocalyptic number.
1530512114 is a deficient number, since it is larger than the sum of its proper divisors (765256060).
1530512114 is an equidigital number, since it uses as much as digits as its factorization.
1530512114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765256059.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 1530512114 is about 39121.7601086659. The cubic root of 1530512114 is about 1152.4239016952.
Adding to 1530512114 its reverse (4112150351), we get a palindrome (5642662465).
The spelling of 1530512114 in words is "one billion, five hundred thirty million, five hundred twelve thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •