Base | Representation |
---|---|
bin | 100001111011001000001… |
… | …001000110001100111011 |
3 | 22020212022102201110020220 |
4 | 201323020021012030323 |
5 | 301143324401233311 |
6 | 4542541411351123 |
7 | 330266024630424 |
oct | 41731011061473 |
9 | 8225272643226 |
10 | 2331230102331 |
11 | 81973a688209 |
12 | 3179842b24a3 |
13 | 13baac55bc70 |
14 | 80b9156464b |
15 | 4099229a206 |
hex | 21ec824633b |
2331230102331 has 8 divisors (see below), whose sum is σ = 3347407326480. Its totient is φ = 1434603139872.
The previous prime is 2331230102323. The next prime is 2331230102393. The reversal of 2331230102331 is 1332010321332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2331230102331 - 23 = 2331230102323 is a prime.
It is a super-2 number, since 2×23312301023312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2331230102321) 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 7 ways as a sum of consecutive naturals, for example, 29887565376 + ... + 29887565453.
It is an arithmetic number, because the mean of its divisors is an integer number (418425915810).
Almost surely, 22331230102331 is an apocalyptic number.
2331230102331 is a deficient number, since it is larger than the sum of its proper divisors (1016177224149).
2331230102331 is a wasteful number, since it uses less digits than its factorization.
2331230102331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59775130845.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 2331230102331 its reverse (1332010321332), we get a palindrome (3663240423663).
The spelling of 2331230102331 in words is "two trillion, three hundred thirty-one billion, two hundred thirty million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •