Base | Representation |
---|---|
bin | 101011001101101… |
… | …0111100110100101 |
3 | 10202001110101211111 |
4 | 1112123113212211 |
5 | 10432200441031 |
6 | 355514505021 |
7 | 50634632251 |
oct | 12633274645 |
9 | 3661411744 |
10 | 1450015141 |
11 | 68454a923 |
12 | 345735171 |
13 | 1a1540a33 |
14 | da811261 |
15 | 874741b1 |
hex | 566d79a5 |
1450015141 has 2 divisors, whose sum is σ = 1450015142. Its totient is φ = 1450015140.
The previous prime is 1450015123. The next prime is 1450015159. The reversal of 1450015141 is 1415100541.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1450015123) and next prime (1450015159).
It can be written as a sum of positive squares in only one way, i.e., 1450010241 + 4900 = 38079^2 + 70^2 .
It is an emirp because it is prime and its reverse (1415100541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1450015141 - 223 = 1441626533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1450015121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725007570 + 725007571.
It is an arithmetic number, because the mean of its divisors is an integer number (725007571).
Almost surely, 21450015141 is an apocalyptic number.
It is an amenable number.
1450015141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450015141 is an equidigital number, since it uses as much as digits as its factorization.
1450015141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 1450015141 is about 38079.0643398705. The cubic root of 1450015141 is about 1131.8551355720.
Adding to 1450015141 its reverse (1415100541), we get a palindrome (2865115682).
The spelling of 1450015141 in words is "one billion, four hundred fifty million, fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •