Base | Representation |
---|---|
bin | 101111110000000100001100… |
… | …110101110111110011110011 |
3 | 1000112120212200210120112211220 |
4 | 233300010030311313303303 |
5 | 210011311000204240311 |
6 | 2022353454444440123 |
7 | 62143545042433146 |
oct | 5760041465676363 |
9 | 1015525623515756 |
10 | 210011231321331 |
11 | 60a09299110310 |
12 | 1b679700549043 |
13 | 9024c8824456b |
14 | 39c085263a05d |
15 | 1942d1a016206 |
hex | bf010cd77cf3 |
210011231321331 has 8 divisors (see below), whose sum is σ = 305470881921984. Its totient is φ = 127279534134120.
The previous prime is 210011231321279. The next prime is 210011231321347. The reversal of 210011231321331 is 133123132110012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210011231321331 - 237 = 209873792367859 is a prime.
It is a super-2 number, since 2×2100112313213312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210011231322331) 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, 3181988353321 + ... + 3181988353386.
It is an arithmetic number, because the mean of its divisors is an integer number (38183860240248).
Almost surely, 2210011231321331 is an apocalyptic number.
210011231321331 is a deficient number, since it is larger than the sum of its proper divisors (95459650600653).
210011231321331 is a wasteful number, since it uses less digits than its factorization.
210011231321331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6363976706721.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 210011231321331 its reverse (133123132110012), we get a palindrome (343134363431343).
The spelling of 210011231321331 in words is "two hundred ten trillion, eleven billion, two hundred thirty-one million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •