Base | Representation |
---|---|
bin | 101011001110111… |
… | …1000111101110001 |
3 | 10202002200222110202 |
4 | 1112131320331301 |
5 | 10432333113311 |
6 | 355541004545 |
7 | 50643354221 |
oct | 12635707561 |
9 | 3662628422 |
10 | 1450676081 |
11 | 684961458 |
12 | 3459b3755 |
13 | 1a171281a |
14 | da944081 |
15 | 87554e3b |
hex | 56778f71 |
1450676081 has 2 divisors, whose sum is σ = 1450676082. Its totient is φ = 1450676080.
The previous prime is 1450676041. The next prime is 1450676083. The reversal of 1450676081 is 1806760541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1448944225 + 1731856 = 38065^2 + 1316^2 .
It is a cyclic number.
It is not a de Polignac number, because 1450676081 - 226 = 1383567217 is a prime.
It is a super-2 number, since 2×14506760812 = 4208922183971037122, which contains 22 as substring.
Together with 1450676083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1450676083) 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, 725338040 + 725338041.
It is an arithmetic number, because the mean of its divisors is an integer number (725338041).
Almost surely, 21450676081 is an apocalyptic number.
It is an amenable number.
1450676081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1450676081 is an equidigital number, since it uses as much as digits as its factorization.
1450676081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 1450676081 is about 38087.7418732064. The cubic root of 1450676081 is about 1132.0270819831.
The spelling of 1450676081 in words is "one billion, four hundred fifty million, six hundred seventy-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •