Base | Representation |
---|---|
bin | 10000000000000… |
… | …00111000000001 |
3 | 100100120011000202 |
4 | 20000000320001 |
5 | 233330040223 |
6 | 21152454545 |
7 | 3216601532 |
oct | 1000007001 |
9 | 310504022 |
10 | 134221313 |
11 | 69845506 |
12 | 38b4a455 |
13 | 21a65cc5 |
14 | 13b7c689 |
15 | bbb4428 |
hex | 8000e01 |
134221313 has 2 divisors, whose sum is σ = 134221314. Its totient is φ = 134221312.
The previous prime is 134221291. The next prime is 134221337. The reversal of 134221313 is 313122431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131148304 + 3073009 = 11452^2 + 1753^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134221313 is a prime.
It is a super-3 number, since 3×1342213133 (a number of 25 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (134221393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67110656 + 67110657.
It is an arithmetic number, because the mean of its divisors is an integer number (67110657).
Almost surely, 2134221313 is an apocalyptic number.
It is an amenable number.
134221313 is a deficient number, since it is larger than the sum of its proper divisors (1).
134221313 is an equidigital number, since it uses as much as digits as its factorization.
134221313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 20.
The square root of 134221313 is about 11585.3922246940. The cubic root of 134221313 is about 512.0045585226.
Adding to 134221313 its reverse (313122431), we get a palindrome (447343744).
The spelling of 134221313 in words is "one hundred thirty-four million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •