Base | Representation |
---|---|
bin | 110001000101100111… |
… | …1011101100000001011 |
3 | 101002002120111010212021 |
4 | 1202023033131200023 |
5 | 3211342304114011 |
6 | 120232131425311 |
7 | 10421201163310 |
oct | 1421317354013 |
9 | 332076433767 |
10 | 105415301131 |
11 | 40785209a88 |
12 | 1851b455237 |
13 | 9c2c70933a |
14 | 516034ad07 |
15 | 2b1e878471 |
hex | 188b3dd80b |
105415301131 has 8 divisors (see below), whose sum is σ = 120492218624. Its totient is φ = 90342780840.
The previous prime is 105415301129. The next prime is 105415301137. The reversal of 105415301131 is 131103514501.
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 105415301131 - 21 = 105415301129 is a prime.
It is a super-2 number, since 2×1054153011312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105415301096 and 105415301105.
It is not an unprimeable number, because it can be changed into a prime (105415301137) 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, 1047765 + ... + 1143958.
It is an arithmetic number, because the mean of its divisors is an integer number (15061527328).
Almost surely, 2105415301131 is an apocalyptic number.
105415301131 is a deficient number, since it is larger than the sum of its proper divisors (15076917493).
105415301131 is an equidigital number, since it uses as much as digits as its factorization.
105415301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2198601.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 105415301131 its reverse (131103514501), we get a palindrome (236518815632).
The spelling of 105415301131 in words is "one hundred five billion, four hundred fifteen million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •