Base | Representation |
---|---|
bin | 110001000001011000… |
… | …1000100111100010011 |
3 | 101001201122221111221021 |
4 | 1202002301010330103 |
5 | 3211044404242413 |
6 | 120210052140311 |
7 | 10414523512531 |
oct | 1420261047423 |
9 | 331648844837 |
10 | 105273118483 |
11 | 40711a27065 |
12 | 1849b907697 |
13 | 9c091166b0 |
14 | 51494d9151 |
15 | 2b1214018d |
hex | 1882c44f13 |
105273118483 has 4 divisors (see below), whose sum is σ = 113371050688. Its totient is φ = 97175186280.
The previous prime is 105273118463. The next prime is 105273118513. The reversal of 105273118483 is 384811372501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 384811372501 = 3931 ⋅97891471.
It is a cyclic number.
It is not a de Polignac number, because 105273118483 - 213 = 105273110291 is a prime.
It is a super-2 number, since 2×1052731184832 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105273118463) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4048966083 + ... + 4048966108.
It is an arithmetic number, because the mean of its divisors is an integer number (28342762672).
Almost surely, 2105273118483 is an apocalyptic number.
105273118483 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
105273118483 is a deficient number, since it is larger than the sum of its proper divisors (8097932205).
105273118483 is an equidigital number, since it uses as much as digits as its factorization.
105273118483 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8097932204.
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 105273118483 in words is "one hundred five billion, two hundred seventy-three million, one hundred eighteen thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •