Base | Representation |
---|---|
bin | 110010001010… |
… | …100111011001 |
3 | 220202010100021 |
4 | 302022213121 |
5 | 11331310211 |
6 | 1145510441 |
7 | 216531115 |
oct | 62124731 |
9 | 26663307 |
10 | 13150681 |
11 | 7472335 |
12 | 44a2421 |
13 | 295598b |
14 | 1a64745 |
15 | 124b771 |
hex | c8a9d9 |
13150681 has 2 divisors, whose sum is σ = 13150682. Its totient is φ = 13150680.
The previous prime is 13150667. The next prime is 13150699. The reversal of 13150681 is 18605131.
13150681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12638025 + 512656 = 3555^2 + 716^2 .
It is an emirp because it is prime and its reverse (18605131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13150681 - 25 = 13150649 is a prime.
It is a super-2 number, since 2×131506812 = 345880821527522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13150661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575340 + 6575341.
It is an arithmetic number, because the mean of its divisors is an integer number (6575341).
Almost surely, 213150681 is an apocalyptic number.
It is an amenable number.
13150681 is a deficient number, since it is larger than the sum of its proper divisors (1).
13150681 is an equidigital number, since it uses as much as digits as its factorization.
13150681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 25.
The square root of 13150681 is about 3626.3867692236. The cubic root of 13150681 is about 236.0384465277.
It can be divided in two parts, 13150 and 681, that added together give a palindrome (13831).
The spelling of 13150681 in words is "thirteen million, one hundred fifty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •