Base | Representation |
---|---|
bin | 11000110111111011… |
… | …00000111001100101 |
3 | 1021110122221002222201 |
4 | 30123331200321211 |
5 | 204322111343021 |
6 | 10045034454501 |
7 | 651632142232 |
oct | 143375407145 |
9 | 37418832881 |
10 | 13354012261 |
11 | 5732aa0077 |
12 | 2708294431 |
13 | 134a831205 |
14 | 90979c789 |
15 | 53257e591 |
hex | 31bf60e65 |
13354012261 has 4 divisors (see below), whose sum is σ = 14139542412. Its totient is φ = 12568482112.
The previous prime is 13354012253. The next prime is 13354012283. The reversal of 13354012261 is 16221045331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8624836900 + 4729175361 = 92870^2 + 68769^2 .
It is a cyclic number.
It is not a de Polignac number, because 13354012261 - 23 = 13354012253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13354012201) 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 in 3 ways as a sum of consecutive naturals, for example, 392765050 + ... + 392765083.
It is an arithmetic number, because the mean of its divisors is an integer number (3534885603).
Almost surely, 213354012261 is an apocalyptic number.
It is an amenable number.
13354012261 is a deficient number, since it is larger than the sum of its proper divisors (785530151).
13354012261 is an equidigital number, since it uses as much as digits as its factorization.
13354012261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785530150.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 13354012261 its reverse (16221045331), we get a palindrome (29575057592).
The spelling of 13354012261 in words is "thirteen billion, three hundred fifty-four million, twelve thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •