Base | Representation |
---|---|
bin | 110000111100101011… |
… | …0110111111010001111 |
3 | 101001022122220012010221 |
4 | 1201321112313322033 |
5 | 3210234001120130 |
6 | 120142252412211 |
7 | 10410565630453 |
oct | 1417126677217 |
9 | 331278805127 |
10 | 105115254415 |
11 | 40640903496 |
12 | 18456a77067 |
13 | 9bb24c31c2 |
14 | 5132564663 |
15 | 2b0335a87a |
hex | 18795b7e8f |
105115254415 has 8 divisors (see below), whose sum is σ = 126141935328. Its totient is φ = 84089783520.
The previous prime is 105115254359. The next prime is 105115254487. The reversal of 105115254415 is 514452511501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105115254415 - 211 = 105115252367 is a prime.
It is a super-2 number, since 2×1051152544152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98931 + ... + 469060.
It is an arithmetic number, because the mean of its divisors is an integer number (15767741916).
Almost surely, 2105115254415 is an apocalyptic number.
105115254415 is a deficient number, since it is larger than the sum of its proper divisors (21026680913).
105115254415 is an equidigital number, since it uses as much as digits as its factorization.
105115254415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605009.
The product of its (nonzero) digits is 20000, while the sum is 34.
Adding to 105115254415 its reverse (514452511501), we get a palindrome (619567765916).
The spelling of 105115254415 in words is "one hundred five billion, one hundred fifteen million, two hundred fifty-four thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •