Base | Representation |
---|---|
bin | 11101110011110001010100… |
… | …100110001001101010110011 |
3 | 122012012010121011200122221201 |
4 | 131303301110212021222303 |
5 | 114140424322230432243 |
6 | 1142454545103032031 |
7 | 36420510010100662 |
oct | 3563612446115263 |
9 | 565163534618851 |
10 | 131101001030323 |
11 | 38855693316105 |
12 | 12854303b9b617 |
13 | 581ca0486b59c |
14 | 24534725a0dd9 |
15 | 1025387d8104d |
hex | 773c54989ab3 |
131101001030323 has 8 divisors (see below), whose sum is σ = 138949049196720. Its totient is φ = 123268088928000.
The previous prime is 131101001030299. The next prime is 131101001030359. The reversal of 131101001030323 is 323030100101131.
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 131101001030323 - 217 = 131101000899251 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131101001030323.
It is not an unprimeable number, because it can be changed into a prime (131101001030393) 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, 3783998178 + ... + 3784032823.
It is an arithmetic number, because the mean of its divisors is an integer number (17368631149590).
Almost surely, 2131101001030323 is an apocalyptic number.
131101001030323 is a deficient number, since it is larger than the sum of its proper divisors (7848048166397).
131101001030323 is a wasteful number, since it uses less digits than its factorization.
131101001030323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7568032037.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 131101001030323 its reverse (323030100101131), we get a palindrome (454131101131454).
The spelling of 131101001030323 in words is "one hundred thirty-one trillion, one hundred one billion, one million, thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •