Base | Representation |
---|---|
bin | 1110100110010100101111… |
… | …01110111011000001110001 |
3 | 11012200000210102010221012021 |
4 | 13103022113232323001301 |
5 | 13201434203043332241 |
6 | 152135550324231441 |
7 | 6522242343032164 |
oct | 723122756730161 |
9 | 135600712127167 |
10 | 32103131230321 |
11 | a25795271a698 |
12 | 372597583b581 |
13 | 14bb40a124058 |
14 | 7cdb2aaa3adb |
15 | 3aa121d580d1 |
hex | 1d3297bbb071 |
32103131230321 has 2 divisors, whose sum is σ = 32103131230322. Its totient is φ = 32103131230320.
The previous prime is 32103131230309. The next prime is 32103131230337. The reversal of 32103131230321 is 12303213130123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19171656317025 + 12931474913296 = 4378545^2 + 3596036^2 .
It is a cyclic number.
It is not a de Polignac number, because 32103131230321 - 29 = 32103131229809 is a prime.
It is a super-2 number, since 2×321031312303212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32103131230361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16051565615160 + 16051565615161.
It is an arithmetic number, because the mean of its divisors is an integer number (16051565615161).
Almost surely, 232103131230321 is an apocalyptic number.
It is an amenable number.
32103131230321 is a deficient number, since it is larger than the sum of its proper divisors (1).
32103131230321 is an equidigital number, since it uses as much as digits as its factorization.
32103131230321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 32103131230321 its reverse (12303213130123), we get a palindrome (44406344360444).
The spelling of 32103131230321 in words is "thirty-two trillion, one hundred three billion, one hundred thirty-one million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •