Base | Representation |
---|---|
bin | 101011001110101… |
… | …1011100111010101 |
3 | 10202002110212120011 |
4 | 1112131123213111 |
5 | 10432320241421 |
6 | 355534240221 |
7 | 50642343556 |
oct | 12635334725 |
9 | 3662425504 |
10 | 1450555861 |
11 | 68488a0a7 |
12 | 345956071 |
13 | 1a169cba1 |
14 | da91232d |
15 | 8752e4e1 |
hex | 5675b9d5 |
1450555861 has 2 divisors, whose sum is σ = 1450555862. Its totient is φ = 1450555860.
The previous prime is 1450555859. The next prime is 1450555903. The reversal of 1450555861 is 1685550541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1101576100 + 348979761 = 33190^2 + 18681^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450555861 - 21 = 1450555859 is a prime.
It is a super-2 number, since 2×14505558612 = 4208224611762902642, which contains 22 as substring.
Together with 1450555859, 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 (1450555811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725277930 + 725277931.
It is an arithmetic number, because the mean of its divisors is an integer number (725277931).
Almost surely, 21450555861 is an apocalyptic number.
It is an amenable number.
1450555861 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450555861 is an equidigital number, since it uses as much as digits as its factorization.
1450555861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120000, while the sum is 40.
The square root of 1450555861 is about 38086.1636424568. The cubic root of 1450555861 is about 1131.9958101145.
The spelling of 1450555861 in words is "one billion, four hundred fifty million, five hundred fifty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •