Base | Representation |
---|---|
bin | 101100010010011… |
… | …0000010100011011 |
3 | 10211120020011002010 |
4 | 1120210300110123 |
5 | 11020410430412 |
6 | 403242441003 |
7 | 51553022202 |
oct | 13044602433 |
9 | 3746204063 |
10 | 1486030107 |
11 | 6a2909461 |
12 | 355803163 |
13 | 1a8b40773 |
14 | 101508239 |
15 | 8a6da33c |
hex | 5893051b |
1486030107 has 4 divisors (see below), whose sum is σ = 1981373480. Its totient is φ = 990686736.
The previous prime is 1486030103. The next prime is 1486030157. The reversal of 1486030107 is 7010306841.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7010306841 = 3 ⋅2336768947.
It is not a de Polignac number, because 1486030107 - 22 = 1486030103 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1486030103) 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, 247671682 + ... + 247671687.
It is an arithmetic number, because the mean of its divisors is an integer number (495343370).
Almost surely, 21486030107 is an apocalyptic number.
1486030107 is a deficient number, since it is larger than the sum of its proper divisors (495343373).
1486030107 is an equidigital number, since it uses as much as digits as its factorization.
1486030107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495343372.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 1486030107 is about 38549.0610391485. The cubic root of 1486030107 is about 1141.1494784633.
Adding to 1486030107 its reverse (7010306841), we get a palindrome (8496336948).
The spelling of 1486030107 in words is "one billion, four hundred eighty-six million, thirty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •