Base | Representation |
---|---|
bin | 10111111110011100101010… |
… | …011001001101000011101011 |
3 | 111211100120201122010220112212 |
4 | 113332130222121031003223 |
5 | 102310113314023144001 |
6 | 1012133233143355335 |
7 | 31132153261501661 |
oct | 2776345231150353 |
9 | 454316648126485 |
10 | 105446453334251 |
11 | 30664653a18667 |
12 | b9b028ba52b4b |
13 | 46ab733890073 |
14 | 1c078c8022c31 |
15 | c2cd86c057bb |
hex | 5fe72a64d0eb |
105446453334251 has 12 divisors (see below), whose sum is σ = 110240791961832. Its totient is φ = 100852328460576.
The previous prime is 105446453334221. The next prime is 105446453334293. The reversal of 105446453334251 is 152433354644501.
It is a happy number.
It is not a de Polignac number, because 105446453334251 - 222 = 105446449139947 is a prime.
It is a super-2 number, since 2×1054464533342512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105446453334251.
It is not an unprimeable number, because it can be changed into a prime (105446453334221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3756866 + ... + 15000231.
It is an arithmetic number, because the mean of its divisors is an integer number (9186732663486).
Almost surely, 2105446453334251 is an apocalyptic number.
105446453334251 is a deficient number, since it is larger than the sum of its proper divisors (4794338627581).
105446453334251 is a wasteful number, since it uses less digits than its factorization.
105446453334251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18767770 (or 18767747 counting only the distinct ones).
The product of its (nonzero) digits is 10368000, while the sum is 50.
The spelling of 105446453334251 in words is "one hundred five trillion, four hundred forty-six billion, four hundred fifty-three million, three hundred thirty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •