Base | Representation |
---|---|
bin | 100101110000100100000110… |
… | …0100001100101011011000111 |
3 | 1121112222022122221000000200121 |
4 | 1023201020030201211123013 |
5 | 322013104300432132221 |
6 | 3134214232510522411 |
7 | 126646413535065541 |
oct | 11341101441453307 |
9 | 1545868587000617 |
10 | 332130031130311 |
11 | 96910611a63117 |
12 | 31301037506407 |
13 | 1134295c55c54b |
14 | 5c03271d22691 |
15 | 285e6e7077a41 |
hex | 12e120c8656c7 |
332130031130311 has 2 divisors, whose sum is σ = 332130031130312. Its totient is φ = 332130031130310.
The previous prime is 332130031130309. The next prime is 332130031130333. The reversal of 332130031130311 is 113031130031233.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 332130031130311 - 21 = 332130031130309 is a prime.
It is a super-2 number, since 2×3321300311303112 (a number of 30 digits) contains 22 as substring.
Together with 332130031130309, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (332130031130411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166065015565155 + 166065015565156.
It is an arithmetic number, because the mean of its divisors is an integer number (166065015565156).
Almost surely, 2332130031130311 is an apocalyptic number.
332130031130311 is a deficient number, since it is larger than the sum of its proper divisors (1).
332130031130311 is an equidigital number, since it uses as much as digits as its factorization.
332130031130311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 332130031130311 its reverse (113031130031233), we get a palindrome (445161161161544).
The spelling of 332130031130311 in words is "three hundred thirty-two trillion, one hundred thirty billion, thirty-one million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •