Base | Representation |
---|---|
bin | 100010011110010010100010… |
… | …0001111100101010000001011 |
3 | 1110202122111222012021221211212 |
4 | 1010330211010033211100023 |
5 | 304221110302014002311 |
6 | 2552525555445443335 |
7 | 120604440216115163 |
oct | 10474450417452013 |
9 | 1422574865257755 |
10 | 303230131000331 |
11 | 886891a3835967 |
12 | 2a01404541054b |
13 | 1002762b7c4b62 |
14 | 54c45b93d95a3 |
15 | 250caa18cac8b |
hex | 113c9443e540b |
303230131000331 has 2 divisors, whose sum is σ = 303230131000332. Its totient is φ = 303230131000330.
The previous prime is 303230131000189. The next prime is 303230131000337. The reversal of 303230131000331 is 133000131032303.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 303230131000331 - 222 = 303230126806027 is a prime.
It is a super-2 number, since 2×3032301310003312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 303230131000297 and 303230131000306.
It is not a weakly prime, because it can be changed into another prime (303230131000337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151615065500165 + 151615065500166.
It is an arithmetic number, because the mean of its divisors is an integer number (151615065500166).
Almost surely, 2303230131000331 is an apocalyptic number.
303230131000331 is a deficient number, since it is larger than the sum of its proper divisors (1).
303230131000331 is an equidigital number, since it uses as much as digits as its factorization.
303230131000331 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 23.
Adding to 303230131000331 its reverse (133000131032303), we get a palindrome (436230262032634).
The spelling of 303230131000331 in words is "three hundred three trillion, two hundred thirty billion, one hundred thirty-one million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •