Base | Representation |
---|---|
bin | 110100100101111000110010… |
… | …001101000011010100010001 |
3 | 1010022222020220211210201222012 |
4 | 310211320302031003110101 |
5 | 220304123004311303131 |
6 | 2135534402115552305 |
7 | 66502006313164013 |
oct | 6445706215032421 |
9 | 1108866824721865 |
10 | 231302011041041 |
11 | 677776a5224486 |
12 | 21b37a675bb695 |
13 | 9c0a8bc337275 |
14 | 411911168a1b3 |
15 | 1bb1a695d252b |
hex | d25e32343511 |
231302011041041 has 8 divisors (see below), whose sum is σ = 245811731295744. Its totient is φ = 216892704075840.
The previous prime is 231302011040987. The next prime is 231302011041043. The reversal of 231302011041041 is 140140110203132.
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 231302011041041 - 26 = 231302011040977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231302011040998 and 231302011041016.
It is not an unprimeable number, because it can be changed into a prime (231302011041043) 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, 25103317625 + ... + 25103326838.
It is an arithmetic number, because the mean of its divisors is an integer number (30726466411968).
Almost surely, 2231302011041041 is an apocalyptic number.
It is an amenable number.
231302011041041 is a deficient number, since it is larger than the sum of its proper divisors (14509720254703).
231302011041041 is a wasteful number, since it uses less digits than its factorization.
231302011041041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50206644751.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 231302011041041 its reverse (140140110203132), we get a palindrome (371442121244173).
The spelling of 231302011041041 in words is "two hundred thirty-one trillion, three hundred two billion, eleven million, forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •