Base | Representation |
---|---|
bin | 101100000000000111… |
… | …011111101100000101 |
3 | 11111221200211012211112 |
4 | 230000013133230011 |
5 | 1233230112330221 |
6 | 33412122414405 |
7 | 3261546342155 |
oct | 540007375405 |
9 | 144850735745 |
10 | 47246605061 |
11 | 19045527747 |
12 | 91a6961405 |
13 | 45bc4ac856 |
14 | 2402b9c765 |
15 | 1367cb415b |
hex | b001dfb05 |
47246605061 has 8 divisors (see below), whose sum is σ = 48435710400. Its totient is φ = 46059249760.
The previous prime is 47246605013. The next prime is 47246605079. The reversal of 47246605061 is 16050664274.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 47246605061 - 210 = 47246604037 is a prime.
It is a super-2 number, since 2×472466050612 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47246605001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 382751 + ... + 490908.
It is an arithmetic number, because the mean of its divisors is an integer number (6054463800).
Almost surely, 247246605061 is an apocalyptic number.
47246605061 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
47246605061 is a deficient number, since it is larger than the sum of its proper divisors (1189105339).
47246605061 is a wasteful number, since it uses less digits than its factorization.
47246605061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 875019.
The product of its (nonzero) digits is 241920, while the sum is 41.
The spelling of 47246605061 in words is "forty-seven billion, two hundred forty-six million, six hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •