Base | Representation |
---|---|
bin | 101011000100001… |
… | …0011001000111001 |
3 | 10201201001102110121 |
4 | 1112020103020321 |
5 | 10424411003441 |
6 | 355215413241 |
7 | 50544301663 |
oct | 12610231071 |
9 | 3651042417 |
10 | 1445016121 |
11 | 681745aaa |
12 | 343b24221 |
13 | 1a04b0533 |
14 | d9cad533 |
15 | 86cd7dd1 |
hex | 56213239 |
1445016121 has 2 divisors, whose sum is σ = 1445016122. Its totient is φ = 1445016120.
The previous prime is 1445016109. The next prime is 1445016179. The reversal of 1445016121 is 1216105441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1315875625 + 129140496 = 36275^2 + 11364^2 .
It is an emirp because it is prime and its reverse (1216105441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1445016121 - 29 = 1445015609 is a prime.
It is a super-3 number, since 3×14450161213 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1445017121) 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, 722508060 + 722508061.
It is an arithmetic number, because the mean of its divisors is an integer number (722508061).
Almost surely, 21445016121 is an apocalyptic number.
It is an amenable number.
1445016121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1445016121 is an equidigital number, since it uses as much as digits as its factorization.
1445016121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
The square root of 1445016121 is about 38013.3676619160. The cubic root of 1445016121 is about 1130.5529235975.
The spelling of 1445016121 in words is "one billion, four hundred forty-five million, sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •