Base | Representation |
---|---|
bin | 110001000111111010… |
… | …0100100010100010011 |
3 | 101002021221001211011220 |
4 | 1202033310210110103 |
5 | 3212021441342420 |
6 | 120243514340123 |
7 | 10423123241262 |
oct | 1421764442423 |
9 | 332257054156 |
10 | 105492137235 |
11 | 4081461a0a1 |
12 | 1854112a643 |
13 | 9c425cc5a4 |
14 | 516a62c5d9 |
15 | 2b264a4840 |
hex | 188fd24513 |
105492137235 has 8 divisors (see below), whose sum is σ = 168787419600. Its totient is φ = 56262473184.
The previous prime is 105492137227. The next prime is 105492137243. The reversal of 105492137235 is 532731294501.
It is an interprime number because it is at equal distance from previous prime (105492137227) and next prime (105492137243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105492137235 - 23 = 105492137227 is a prime.
It is a super-2 number, since 2×1054921372352 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3516404560 + ... + 3516404589.
It is an arithmetic number, because the mean of its divisors is an integer number (21098427450).
Almost surely, 2105492137235 is an apocalyptic number.
105492137235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105492137235 is a deficient number, since it is larger than the sum of its proper divisors (63295282365).
105492137235 is an equidigital number, since it uses as much as digits as its factorization.
105492137235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7032809157.
The product of its (nonzero) digits is 226800, while the sum is 42.
The spelling of 105492137235 in words is "one hundred five billion, four hundred ninety-two million, one hundred thirty-seven thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •