Base | Representation |
---|---|
bin | 101011010000001… |
… | …1111000111010111 |
3 | 10202010222120000022 |
4 | 1112200133013113 |
5 | 10433021403011 |
6 | 400003335355 |
7 | 50652220304 |
oct | 12640370727 |
9 | 3663876008 |
10 | 1451356631 |
11 | 68528679a |
12 | 34608155b |
13 | 1a18c050a |
14 | daa800ab |
15 | 8763b8db |
hex | 5681f1d7 |
1451356631 has 2 divisors, whose sum is σ = 1451356632. Its totient is φ = 1451356630.
The previous prime is 1451356607. The next prime is 1451356639. The reversal of 1451356631 is 1366531541.
It is a strong prime.
It is an emirp because it is prime and its reverse (1366531541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1451356631 is a prime.
It is a super-2 number, since 2×14513566312 = 4212872140695340322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1451356591 and 1451356600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1451356639) 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, 725678315 + 725678316.
It is an arithmetic number, because the mean of its divisors is an integer number (725678316).
Almost surely, 21451356631 is an apocalyptic number.
1451356631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1451356631 is an equidigital number, since it uses as much as digits as its factorization.
1451356631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32400, while the sum is 35.
The square root of 1451356631 is about 38096.6748024024. The cubic root of 1451356631 is about 1132.2040754554.
The spelling of 1451356631 in words is "one billion, four hundred fifty-one million, three hundred fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •