Base | Representation |
---|---|
bin | 1001101001000111011… |
… | …10111111000011001111 |
3 | 1011200011200222111110102 |
4 | 10310203232333003033 |
5 | 20412011333014411 |
6 | 412111434001315 |
7 | 32636135354561 |
oct | 4644356770317 |
9 | 1150150874412 |
10 | 331312001231 |
11 | 118565a95272 |
12 | 5426387623b |
13 | 2531cc713a3 |
14 | 1206d913331 |
15 | 8941598d3b |
hex | 4d23bbf0cf |
331312001231 has 8 divisors (see below), whose sum is σ = 349375607280. Its totient is φ = 313311008448.
The previous prime is 331312001219. The next prime is 331312001333. The reversal of 331312001231 is 132100213133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 331312001231 - 222 = 331307806927 is a prime.
It is a super-2 number, since 2×3313120012312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331312001431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15642446 + ... + 15663611.
It is an arithmetic number, because the mean of its divisors is an integer number (43671950910).
Almost surely, 2331312001231 is an apocalyptic number.
331312001231 is a deficient number, since it is larger than the sum of its proper divisors (18063606049).
331312001231 is a wasteful number, since it uses less digits than its factorization.
331312001231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31306633.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 331312001231 its reverse (132100213133), we get a palindrome (463412214364).
The spelling of 331312001231 in words is "three hundred thirty-one billion, three hundred twelve million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •