Base | Representation |
---|---|
bin | 1110011101001… |
… | …0010010000111 |
3 | 11020002022221011 |
4 | 3213102102013 |
5 | 111010131101 |
6 | 10003303051 |
7 | 1334230201 |
oct | 347222207 |
9 | 136068834 |
10 | 60630151 |
11 | 3125136a |
12 | 1837aa87 |
13 | c73aa3a |
14 | 80a3771 |
15 | 54c9751 |
hex | 39d2487 |
60630151 has 2 divisors, whose sum is σ = 60630152. Its totient is φ = 60630150.
The previous prime is 60630149. The next prime is 60630173. The reversal of 60630151 is 15103606.
60630151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (60630173) can be obtained adding 60630151 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 60630151 - 21 = 60630149 is a prime.
Together with 60630149, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (60630131) 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 as a sum of consecutive naturals, namely, 30315075 + 30315076.
It is an arithmetic number, because the mean of its divisors is an integer number (30315076).
Almost surely, 260630151 is an apocalyptic number.
60630151 is a deficient number, since it is larger than the sum of its proper divisors (1).
60630151 is an equidigital number, since it uses as much as digits as its factorization.
60630151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 60630151 is about 7786.5365214580. The cubic root of 60630151 is about 392.8525259938.
Adding to 60630151 its reverse (15103606), we get a palindrome (75733757).
The spelling of 60630151 in words is "sixty million, six hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •