Base | Representation |
---|---|
bin | 100001111011001000011… |
… | …000101111001100111111 |
3 | 22020212022201102202112110 |
4 | 201323020120233030333 |
5 | 301143331423434211 |
6 | 4542542035305103 |
7 | 330266104525161 |
oct | 41731030571477 |
9 | 8225281382473 |
10 | 2331234202431 |
11 | 819741a28722 |
12 | 31798574b193 |
13 | 13bab0366264 |
14 | 80b91d10931 |
15 | 40992809ea6 |
hex | 21ec862f33f |
2331234202431 has 16 divisors (see below), whose sum is σ = 3238092990720. Its totient is φ = 1490550732480.
The previous prime is 2331234202387. The next prime is 2331234202433. The reversal of 2331234202431 is 1342024321332.
It is a happy number.
It is not a de Polignac number, because 2331234202431 - 210 = 2331234201407 is a prime.
It is a super-2 number, since 2×23312342024312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2331234202433) 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 15 ways as a sum of consecutive naturals, for example, 160612435 + ... + 160626948.
It is an arithmetic number, because the mean of its divisors is an integer number (202380811920).
Almost surely, 22331234202431 is an apocalyptic number.
2331234202431 is a deficient number, since it is larger than the sum of its proper divisors (906858788289).
2331234202431 is a wasteful number, since it uses less digits than its factorization.
2331234202431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321239486.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 2331234202431 its reverse (1342024321332), we get a palindrome (3673258523763).
The spelling of 2331234202431 in words is "two trillion, three hundred thirty-one billion, two hundred thirty-four million, two hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •