Base | Representation |
---|---|
bin | 101011001110110… |
… | …0110110111000001 |
3 | 10202002120012202002 |
4 | 1112131212313001 |
5 | 10432323230141 |
6 | 355535233345 |
7 | 50642625056 |
oct | 12635466701 |
9 | 3662505662 |
10 | 1450601921 |
11 | 68491076a |
12 | 345978855 |
13 | 1a16b7b42 |
14 | da92502d |
15 | 8753ce9b |
hex | 56766dc1 |
1450601921 has 2 divisors, whose sum is σ = 1450601922. Its totient is φ = 1450601920.
The previous prime is 1450601917. The next prime is 1450601951. The reversal of 1450601921 is 1291060541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1310440000 + 140161921 = 36200^2 + 11839^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450601921 - 22 = 1450601917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1450601951) 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, 725300960 + 725300961.
It is an arithmetic number, because the mean of its divisors is an integer number (725300961).
Almost surely, 21450601921 is an apocalyptic number.
It is an amenable number.
1450601921 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450601921 is an equidigital number, since it uses as much as digits as its factorization.
1450601921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The square root of 1450601921 is about 38086.7683191945. The cubic root of 1450601921 is about 1132.0077915386.
The spelling of 1450601921 in words is "one billion, four hundred fifty million, six hundred one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •