Base | Representation |
---|---|
bin | 110110101101101010011000… |
… | …0011111000111011110011000 |
3 | 2100010000110112021010110002022 |
4 | 1231123110300133013132120 |
5 | 1001040020234133212021 |
6 | 4423321553423354012 |
7 | 203241142663503662 |
oct | 15533246037073630 |
9 | 2303013467113068 |
10 | 481264783882136 |
11 | 12a389280a55391 |
12 | 45b8840a452908 |
13 | 178700c7575027 |
14 | 86bb4a86a1532 |
15 | 3a98c04e6c1ab |
hex | 1b5b5307c7798 |
481264783882136 has 16 divisors (see below), whose sum is σ = 904224388615440. Its totient is φ = 240138280251360.
The previous prime is 481264783882111. The next prime is 481264783882171. The reversal of 481264783882136 is 631288387462184.
It is a super-2 number, since 2×4812647838821362 (a number of 30 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (71) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 481264783882136.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61763957075 + ... + 61763964866.
It is an arithmetic number, because the mean of its divisors is an integer number (56514024288465).
Almost surely, 2481264783882136 is an apocalyptic number.
It is an amenable number.
481264783882136 is a deficient number, since it is larger than the sum of its proper divisors (422959604733304).
481264783882136 is a wasteful number, since it uses less digits than its factorization.
481264783882136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123527922434 (or 123527922430 counting only the distinct ones).
The product of its digits is 594542592, while the sum is 71.
The spelling of 481264783882136 in words is "four hundred eighty-one trillion, two hundred sixty-four billion, seven hundred eighty-three million, eight hundred eighty-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •