Base | Representation |
---|---|
bin | 10111111010010101101001… |
… | …100001000101111100010111 |
3 | 111210100120210002010222102110 |
4 | 113322111221201011330113 |
5 | 102241001430344302320 |
6 | 1011355410050442103 |
7 | 31102565026310565 |
oct | 2772255141057427 |
9 | 453316702128373 |
10 | 105164044525335 |
11 | 30565903571614 |
12 | b9655b5893333 |
13 | 468ac08387a83 |
14 | 1bd7d772d2a35 |
15 | c25858a9b5e0 |
hex | 5fa569845f17 |
105164044525335 has 16 divisors (see below), whose sum is σ = 171437234850144. Its totient is φ = 55029235876992.
The previous prime is 105164044525277. The next prime is 105164044525363. The reversal of 105164044525335 is 533525440461501.
It is a happy number.
It is not a de Polignac number, because 105164044525335 - 233 = 105155454590743 is a prime.
It is a super-2 number, since 2×1051640445253352 (a number of 29 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 15 ways as a sum of consecutive naturals, for example, 66140907712 + ... + 66140909301.
It is an arithmetic number, because the mean of its divisors is an integer number (10714827178134).
Almost surely, 2105164044525335 is an apocalyptic number.
105164044525335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105164044525335 is a deficient number, since it is larger than the sum of its proper divisors (66273190324809).
105164044525335 is a wasteful number, since it uses less digits than its factorization.
105164044525335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132281817074.
The product of its (nonzero) digits is 4320000, while the sum is 48.
Adding to 105164044525335 its reverse (533525440461501), we get a palindrome (638689484986836).
The spelling of 105164044525335 in words is "one hundred five trillion, one hundred sixty-four billion, forty-four million, five hundred twenty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •