Base | Representation |
---|---|
bin | 110000111101001101… |
… | …1111000001010110111 |
3 | 101001100220221012120220 |
4 | 1201322123320022313 |
5 | 3210303113442130 |
6 | 120144140225423 |
7 | 10411205450202 |
oct | 1417233701267 |
9 | 331326835526 |
10 | 105133343415 |
11 | 40650038a81 |
12 | 18460b3b273 |
13 | 9bb6187859 |
14 | 5134b12939 |
15 | 2b04c30410 |
hex | 187a6f82b7 |
105133343415 has 8 divisors (see below), whose sum is σ = 168213349488. Its totient is φ = 56071116480.
The previous prime is 105133343323. The next prime is 105133343429. The reversal of 105133343415 is 514343331501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-105133343415 is a prime.
It is a super-2 number, since 2×1051333434152 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3504444766 + ... + 3504444795.
It is an arithmetic number, because the mean of its divisors is an integer number (21026668686).
Almost surely, 2105133343415 is an apocalyptic number.
105133343415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105133343415 is a deficient number, since it is larger than the sum of its proper divisors (63080006073).
105133343415 is an equidigital number, since it uses as much as digits as its factorization.
105133343415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7008889569.
The product of its (nonzero) digits is 32400, while the sum is 33.
Adding to 105133343415 its reverse (514343331501), we get a palindrome (619476674916).
The spelling of 105133343415 in words is "one hundred five billion, one hundred thirty-three million, three hundred forty-three thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •