Base | Representation |
---|---|
bin | 100001111011000010010… |
… | …010110111100000110111 |
3 | 22020212001121010100120202 |
4 | 201323002102313200313 |
5 | 301143124243002221 |
6 | 4542523544551115 |
7 | 330263424031622 |
oct | 41730222674067 |
9 | 8225047110522 |
10 | 2331132000311 |
11 | 81969a272764 |
12 | 31795748249b |
13 | 13ba9513132a |
14 | 80b82508db9 |
15 | 4098886cd0b |
hex | 21ec24b7837 |
2331132000311 has 8 divisors (see below), whose sum is σ = 2493703366560. Its totient is φ = 2171387962368.
The previous prime is 2331132000283. The next prime is 2331132000319. The reversal of 2331132000311 is 1130002311332.
2331132000311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2331132000311 - 230 = 2330058258487 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2331132000319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 706830371 + ... + 706833668.
It is an arithmetic number, because the mean of its divisors is an integer number (311712920820).
Almost surely, 22331132000311 is an apocalyptic number.
2331132000311 is a deficient number, since it is larger than the sum of its proper divisors (162571366249).
2331132000311 is a wasteful number, since it uses less digits than its factorization.
2331132000311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413664153.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 2331132000311 its reverse (1130002311332), we get a palindrome (3461134311643).
The spelling of 2331132000311 in words is "two trillion, three hundred thirty-one billion, one hundred thirty-two million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •