Base | Representation |
---|---|
bin | 101011001111011… |
… | …0100110000110101 |
3 | 10202010011102110022 |
4 | 1112132310300311 |
5 | 10432413433023 |
6 | 355550134525 |
7 | 50645424263 |
oct | 12636646065 |
9 | 3663142408 |
10 | 1450921013 |
11 | 685009483 |
12 | 345ab1445 |
13 | 1a179a159 |
14 | da9a9433 |
15 | 875a27c8 |
hex | 567b4c35 |
1450921013 has 2 divisors, whose sum is σ = 1450921014. Its totient is φ = 1450921012.
The previous prime is 1450920941. The next prime is 1450921019. The reversal of 1450921013 is 3101290541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 924585649 + 526335364 = 30407^2 + 22942^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450921013 - 210 = 1450919989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1450921019) 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, 725460506 + 725460507.
It is an arithmetic number, because the mean of its divisors is an integer number (725460507).
Almost surely, 21450921013 is an apocalyptic number.
It is an amenable number.
1450921013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450921013 is an equidigital number, since it uses as much as digits as its factorization.
1450921013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 1450921013 is about 38090.9571027035. The cubic root of 1450921013 is about 1132.0907888431.
The spelling of 1450921013 in words is "one billion, four hundred fifty million, nine hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •