Base | Representation |
---|---|
bin | 1011111011101111100010… |
… | …0100000011000011000111 |
3 | 1201110100121001221201112010 |
4 | 2332323320210003003013 |
5 | 3204433302040234343 |
6 | 43523412045225303 |
7 | 2522650422353244 |
oct | 276737044030307 |
9 | 51410531851463 |
10 | 13121000321223 |
11 | 41a9648687a73 |
12 | 157ab30562233 |
13 | 7423c7192c22 |
14 | 3350ba1605cb |
15 | 17b492383d33 |
hex | beef89030c7 |
13121000321223 has 32 divisors (see below), whose sum is σ = 17612272117440. Its totient is φ = 8688763765760.
The previous prime is 13121000321183. The next prime is 13121000321237. The reversal of 13121000321223 is 32212300012131.
It is a cyclic number.
It is not a de Polignac number, because 13121000321223 - 236 = 13052280844487 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13121000321223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121000341223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 385203613 + ... + 385237673.
It is an arithmetic number, because the mean of its divisors is an integer number (550383503670).
Almost surely, 213121000321223 is an apocalyptic number.
13121000321223 is a deficient number, since it is larger than the sum of its proper divisors (4491271796217).
13121000321223 is a wasteful number, since it uses less digits than its factorization.
13121000321223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35747.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13121000321223 its reverse (32212300012131), we get a palindrome (45333300333354).
The spelling of 13121000321223 in words is "thirteen trillion, one hundred twenty-one billion, three hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •