Base | Representation |
---|---|
bin | 10101101011101100110011… |
… | …01100001000011010011100 |
3 | 20020211021000121011120102212 |
4 | 22311312121230020122130 |
5 | 22222201202132420430 |
6 | 245224204230535552 |
7 | 13020560613360323 |
oct | 1265663154103234 |
9 | 206737017146385 |
10 | 47681010435740 |
11 | 14213448393350 |
12 | 5420a95b075b8 |
13 | 207b3b9107566 |
14 | babab79d70ba |
15 | 57a45c2eab95 |
hex | 2b5d99b0869c |
47681010435740 has 96 divisors (see below), whose sum is σ = 109357071183360. Its totient is φ = 17318838521600.
The previous prime is 47681010435713. The next prime is 47681010435743. The reversal of 47681010435740 is 4753401018674.
47681010435740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47681010435743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2112478655 + ... + 2112501225.
It is an arithmetic number, because the mean of its divisors is an integer number (1139136158160).
Almost surely, 247681010435740 is an apocalyptic number.
It is an amenable number.
47681010435740 is an abundant number, since it is smaller than the sum of its proper divisors (61676060747620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47681010435740 is a wasteful number, since it uses less digits than its factorization.
47681010435740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33083 (or 33081 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 50.
The spelling of 47681010435740 in words is "forty-seven trillion, six hundred eighty-one billion, ten million, four hundred thirty-five thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •