Base | Representation |
---|---|
bin | 110110101111100110111011… |
… | …1111110010011001000110100 |
3 | 2100010222000221220201122201121 |
4 | 1231133031313332103020310 |
5 | 1001103411042412223220 |
6 | 4424044512125233324 |
7 | 203266362401335666 |
oct | 15537156776231064 |
9 | 2303860856648647 |
10 | 481532271211060 |
11 | 12a48176463a693 |
12 | 4601021b402844 |
13 | 1788c3b5593b14 |
14 | 86ca4017aa536 |
15 | 3aa0b5d121eaa |
hex | 1b5f377f93234 |
481532271211060 has 12 divisors (see below), whose sum is σ = 1011217769543268. Its totient is φ = 192612908484416.
The previous prime is 481532271211001. The next prime is 481532271211091. The reversal of 481532271211060 is 60112172235184.
It can be written as a sum of positive squares in 2 ways, for example, as 130245567100324 + 351286704110736 = 11412518^2 + 18742644^2 .
It is a junction number, because it is equal to n+sod(n) for n = 481532271210998 and 481532271211016.
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, 12038306780257 + ... + 12038306780296.
It is an arithmetic number, because the mean of its divisors is an integer number (84268147461939).
Almost surely, 2481532271211060 is an apocalyptic number.
It is an amenable number.
481532271211060 is an abundant number, since it is smaller than the sum of its proper divisors (529685498332208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481532271211060 is a wasteful number, since it uses less digits than its factorization.
481532271211060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24076613560562 (or 24076613560560 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 481532271211060 in words is "four hundred eighty-one trillion, five hundred thirty-two billion, two hundred seventy-one million, two hundred eleven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •