Base | Representation |
---|---|
bin | 110100100110000011000001… |
… | …110110100100101010011011 |
3 | 1010100000022022110011122200001 |
4 | 310212003001312210222123 |
5 | 220304313021304031021 |
6 | 2135543421423153431 |
7 | 66502546022255041 |
oct | 6446030166445233 |
9 | 1110008273148601 |
10 | 231313011002011 |
11 | 6778132a435a14 |
12 | 21b3a017445877 |
13 | 9c0b953249c03 |
14 | 411987654a391 |
15 | 1bb1eb0165091 |
hex | d260c1da4a9b |
231313011002011 has 8 divisors (see below), whose sum is σ = 231962825446704. Its totient is φ = 230663923015680.
The previous prime is 231313011001999. The next prime is 231313011002041. The reversal of 231313011002011 is 110200110313132.
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 231313011002011 - 25 = 231313011001979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 231313011002011.
It is not an unprimeable number, because it can be changed into a prime (231313011002041) 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, 180976870 + ... + 182250523.
It is an arithmetic number, because the mean of its divisors is an integer number (28995353180838).
Almost surely, 2231313011002011 is an apocalyptic number.
231313011002011 is a deficient number, since it is larger than the sum of its proper divisors (649814444693).
231313011002011 is a wasteful number, since it uses less digits than its factorization.
231313011002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363229181.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 231313011002011 its reverse (110200110313132), we get a palindrome (341513121315143).
The spelling of 231313011002011 in words is "two hundred thirty-one trillion, three hundred thirteen billion, eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •