Base | Representation |
---|---|
bin | 1001101000111111100… |
… | …00101010001110000011 |
3 | 1011200000001112022112212 |
4 | 10310133300222032003 |
5 | 20411342301100311 |
6 | 412101053012335 |
7 | 32634365600645 |
oct | 4643760521603 |
9 | 1150001468485 |
10 | 331245331331 |
11 | 118531399182 |
12 | 542454840ab |
13 | 2530c1ca545 |
14 | 12064b1a895 |
15 | 893a7c9c8b |
hex | 4d1fc2a383 |
331245331331 has 4 divisors (see below), whose sum is σ = 334660231752. Its totient is φ = 327830430912.
The previous prime is 331245331301. The next prime is 331245331337. The reversal of 331245331331 is 133133542133.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331245331331 is a prime.
It is a super-2 number, since 2×3312453313312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (331245331337) 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 in 3 ways as a sum of consecutive naturals, for example, 1707450065 + ... + 1707450258.
It is an arithmetic number, because the mean of its divisors is an integer number (83665057938).
Almost surely, 2331245331331 is an apocalyptic number.
331245331331 is a deficient number, since it is larger than the sum of its proper divisors (3414900421).
331245331331 is an equidigital number, since it uses as much as digits as its factorization.
331245331331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3414900420.
The product of its digits is 29160, while the sum is 32.
Adding to 331245331331 its reverse (133133542133), we get a palindrome (464378873464).
The spelling of 331245331331 in words is "three hundred thirty-one billion, two hundred forty-five million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •