Base | Representation |
---|---|
bin | 1001101000111100101… |
… | …00101110010110100101 |
3 | 1011122221101011220010111 |
4 | 10310132110232112211 |
5 | 20411320113343023 |
6 | 412054432253021 |
7 | 32633654003431 |
oct | 4643624562645 |
9 | 1148841156114 |
10 | 331221231013 |
11 | 118519828262 |
12 | 542393a1171 |
13 | 2530720c9ba |
14 | 120618459c1 |
15 | 893861900d |
hex | 4d1e52e5a5 |
331221231013 has 2 divisors, whose sum is σ = 331221231014. Its totient is φ = 331221231012.
The previous prime is 331221231007. The next prime is 331221231037. The reversal of 331221231013 is 310132122133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 239882489284 + 91338741729 = 489778^2 + 302223^2 .
It is an emirp because it is prime and its reverse (310132122133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 331221231013 - 213 = 331221222821 is a prime.
It is a super-2 number, since 2×3312212310132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331221231113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165610615506 + 165610615507.
It is an arithmetic number, because the mean of its divisors is an integer number (165610615507).
Almost surely, 2331221231013 is an apocalyptic number.
It is an amenable number.
331221231013 is a deficient number, since it is larger than the sum of its proper divisors (1).
331221231013 is an equidigital number, since it uses as much as digits as its factorization.
331221231013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 331221231013 its reverse (310132122133), we get a palindrome (641353353146).
The spelling of 331221231013 in words is "three hundred thirty-one billion, two hundred twenty-one million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •