Base | Representation |
---|---|
bin | 110100100001110100000110… |
… | …001111001000000011110011 |
3 | 1010021222111102101202121221111 |
4 | 310201310012033020003303 |
5 | 220240031230212404021 |
6 | 2135202030545534151 |
7 | 66442540005021433 |
oct | 6441640617100363 |
9 | 1107874371677844 |
10 | 231022100513011 |
11 | 67679a17007885 |
12 | 21ab176a044357 |
13 | 9bba3a15abaa2 |
14 | 410975a6802c3 |
15 | 1ba96359648e1 |
hex | d21d063c80f3 |
231022100513011 has 8 divisors (see below), whose sum is σ = 234485080578000. Its totient is φ = 227559558360288.
The previous prime is 231022100512991. The next prime is 231022100513033. The reversal of 231022100513011 is 110315001220132.
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 231022100513011 - 29 = 231022100512499 is a prime.
It is a super-2 number, since 2×2310221005130112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231022100513311) 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, 108414976 + ... + 110525341.
It is an arithmetic number, because the mean of its divisors is an integer number (29310635072250).
Almost surely, 2231022100513011 is an apocalyptic number.
231022100513011 is a deficient number, since it is larger than the sum of its proper divisors (3462980064989).
231022100513011 is a wasteful number, since it uses less digits than its factorization.
231022100513011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218956133.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 231022100513011 its reverse (110315001220132), we get a palindrome (341337101733143).
The spelling of 231022100513011 in words is "two hundred thirty-one trillion, twenty-two billion, one hundred million, five hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •