Base | Representation |
---|---|
bin | 110000000100010111110… |
… | …110100101000011010011 |
3 | 102200210012210002001000222 |
4 | 300010113312211003103 |
5 | 413110003342043011 |
6 | 11005252151303255 |
7 | 460436056006526 |
oct | 60042766450323 |
9 | 12623183061028 |
10 | 3303230034131 |
11 | 106398a26a475 |
12 | 45423107ab2b |
13 | 1ac6548b49c1 |
14 | b5c3d000bbd |
15 | 5add0784ddb |
hex | 30117da50d3 |
3303230034131 has 2 divisors, whose sum is σ = 3303230034132. Its totient is φ = 3303230034130.
The previous prime is 3303230034127. The next prime is 3303230034149. The reversal of 3303230034131 is 1314300323033.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3303230034131 - 22 = 3303230034127 is a prime.
It is a super-2 number, since 2×33032300341312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3303230034131.
It is not a weakly prime, because it can be changed into another prime (3303230034121) 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 as a sum of consecutive naturals, namely, 1651615017065 + 1651615017066.
It is an arithmetic number, because the mean of its divisors is an integer number (1651615017066).
Almost surely, 23303230034131 is an apocalyptic number.
3303230034131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3303230034131 is an equidigital number, since it uses as much as digits as its factorization.
3303230034131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 3303230034131 its reverse (1314300323033), we get a palindrome (4617530357164).
The spelling of 3303230034131 in words is "three trillion, three hundred three billion, two hundred thirty million, thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •