Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100010001111110101011011 |
3 | 112102110220020211210120120212 |
4 | 121000231133202033311123 |
5 | 103404220010104344011 |
6 | 1025541150155041335 |
7 | 32112144540501116 |
oct | 3100553742176533 |
9 | 472426224716525 |
10 | 110000010231131 |
11 | 3205a819098a79 |
12 | 104068a4a4024b |
13 | 494bc58444297 |
14 | 1d2405944557d |
15 | cab54558408b |
hex | 640b5f88fd5b |
110000010231131 has 8 divisors (see below), whose sum is σ = 112558845098304. Its totient is φ = 107441206959240.
The previous prime is 110000010231103. The next prime is 110000010231143. The reversal of 110000010231131 is 131132010000011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110000010231131 is a prime.
It is a super-2 number, since 2×1100000102311312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110000010231191) 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, 781025 + ... + 14852946.
It is an arithmetic number, because the mean of its divisors is an integer number (14069855637288).
Almost surely, 2110000010231131 is an apocalyptic number.
110000010231131 is a deficient number, since it is larger than the sum of its proper divisors (2558834867173).
110000010231131 is a wasteful number, since it uses less digits than its factorization.
110000010231131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15797641.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 110000010231131 its reverse (131132010000011), we get a palindrome (241132020231142).
The spelling of 110000010231131 in words is "one hundred ten trillion, ten million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •