Base | Representation |
---|---|
bin | 110110101100111100111100… |
… | …1100111101111110110100000 |
3 | 2100002200010201022221201221020 |
4 | 1231121321321213233312200 |
5 | 1001031420440004234012 |
6 | 4423205101121125440 |
7 | 203231120300536650 |
oct | 15531717147576640 |
9 | 2302603638851836 |
10 | 481167226633632 |
11 | 12a350969481680 |
12 | 45b71522789880 |
13 | 17863b4ab6c296 |
14 | 86b6891c2c360 |
15 | 3a963e5400a8c |
hex | 1b59e799efda0 |
481167226633632 has 192 divisors, whose sum is σ = 1576094900050944. Its totient is φ = 124870104023040.
The previous prime is 481167226633627. The next prime is 481167226633657. The reversal of 481167226633632 is 236336622761184.
It is a super-2 number, since 2×4811672266336322 (a number of 30 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19704678 + ... + 36750629.
It is an arithmetic number, because the mean of its divisors is an integer number (8208827604432).
Almost surely, 2481167226633632 is an apocalyptic number.
481167226633632 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
481167226633632 is an abundant number, since it is smaller than the sum of its proper divisors (1094927673417312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481167226633632 is a wasteful number, since it uses less digits than its factorization.
481167226633632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56456491 (or 56456483 counting only the distinct ones).
The product of its digits is 62705664, while the sum is 60.
The spelling of 481167226633632 in words is "four hundred eighty-one trillion, one hundred sixty-seven billion, two hundred twenty-six million, six hundred thirty-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •