Base | Representation |
---|---|
bin | 101011110111101011… |
… | …011101111011101001 |
3 | 11111120211102222020000 |
4 | 223313223131323221 |
5 | 1232432342240410 |
6 | 33350104253213 |
7 | 3255210143304 |
oct | 536753357351 |
9 | 144524388200 |
10 | 47105040105 |
11 | 18a82626912 |
12 | 9167471209 |
13 | 45990750c6 |
14 | 23cc06bb3b |
15 | 135a64ddc0 |
hex | af7addee9 |
47105040105 has 20 divisors (see below), whose sum is σ = 84440146692. Its totient is φ = 25122687840.
The previous prime is 47105040061. The next prime is 47105040119. The reversal of 47105040105 is 50104050174.
It is a happy number.
47105040105 is a `hidden beast` number, since 47 + 10 + 504 + 0 + 105 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 33287272704 + 13817767401 = 182448^2 + 117549^2 .
It is not a de Polignac number, because 47105040105 - 27 = 47105039977 is a prime.
It is a super-2 number, since 2×471050401052 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 58153966 + ... + 58154775.
Almost surely, 247105040105 is an apocalyptic number.
47105040105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
47105040105 is a deficient number, since it is larger than the sum of its proper divisors (37335106587).
47105040105 is a wasteful number, since it uses less digits than its factorization.
47105040105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116308758 (or 116308749 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
Adding to 47105040105 its reverse (50104050174), we get a palindrome (97209090279).
The spelling of 47105040105 in words is "forty-seven billion, one hundred five million, forty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •