Base | Representation |
---|---|
bin | 110110101110101011110011… |
… | …1111111110011100000010000 |
3 | 2100010111220020012001220100202 |
4 | 1231131113213333303200100 |
5 | 1001044321024204310323 |
6 | 4423510313102434332 |
7 | 203254246102630055 |
oct | 15535274777634020 |
9 | 2303456205056322 |
10 | 481405301635088 |
11 | 12a432929620a26 |
12 | 45bab6a55929a8 |
13 | 1788042c4967cc |
14 | 86c41d898702c |
15 | 3a9c6cb361d28 |
hex | 1b5d5e7ff3810 |
481405301635088 has 20 divisors (see below), whose sum is σ = 934108689876348. Its totient is φ = 240344994570240.
The previous prime is 481405301635009. The next prime is 481405301635123. The reversal of 481405301635088 is 880536103504184.
It can be written as a sum of positive squares in 2 ways, for example, as 82571969695744 + 398833331939344 = 9086912^2 + 19970812^2 .
It is a super-2 number, since 2×4814053016350882 (a number of 30 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22353504353 + ... + 22353525888.
Almost surely, 2481405301635088 is an apocalyptic number.
It is an amenable number.
481405301635088 is a deficient number, since it is larger than the sum of its proper divisors (452703388241260).
481405301635088 is a wasteful number, since it uses less digits than its factorization.
481405301635088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44707030922 (or 44707030916 counting only the distinct ones).
The product of its (nonzero) digits is 11059200, while the sum is 56.
The spelling of 481405301635088 in words is "four hundred eighty-one trillion, four hundred five billion, three hundred one million, six hundred thirty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •