Base | Representation |
---|---|
bin | 100001111011001000001… |
… | …000110100100110000101 |
3 | 22020212022102120210022212 |
4 | 201323020020310212011 |
5 | 301143324341431323 |
6 | 4542541410033205 |
7 | 330266024210240 |
oct | 41731010644605 |
9 | 8225272523285 |
10 | 2331230030213 |
11 | 81973a639007 |
12 | 317984278805 |
13 | 13baac5351a6 |
14 | 80b91546257 |
15 | 40992283b78 |
hex | 21ec8234985 |
2331230030213 has 8 divisors (see below), whose sum is σ = 2664550156032. Its totient is φ = 1997981720496.
The previous prime is 2331230030183. The next prime is 2331230030219. The reversal of 2331230030213 is 3120300321332.
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 2331230030213 - 224 = 2331213252997 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 (2331230030219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17884445 + ... + 18014322.
It is an arithmetic number, because the mean of its divisors is an integer number (333068769504).
Almost surely, 22331230030213 is an apocalyptic number.
It is an amenable number.
2331230030213 is a deficient number, since it is larger than the sum of its proper divisors (333320125819).
2331230030213 is an equidigital number, since it uses as much as digits as its factorization.
2331230030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35908051.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 2331230030213 its reverse (3120300321332), we get a palindrome (5451530351545).
The spelling of 2331230030213 in words is "two trillion, three hundred thirty-one billion, two hundred thirty million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •