Base | Representation |
---|---|
bin | 1111001101101001001… |
… | …1000010111100100010 |
3 | 220222121122211012112020 |
4 | 3303122103002330202 |
5 | 13240231234314100 |
6 | 320022313442310 |
7 | 24611520200016 |
oct | 3633223027442 |
9 | 828548735466 |
10 | 261360463650 |
11 | a092a193790 |
12 | 427a1110396 |
13 | 1b852894330 |
14 | c915514546 |
15 | 6bea35c5a0 |
hex | 3cda4c2f22 |
261360463650 has 192 divisors, whose sum is σ = 763694870400. Its totient is φ = 58317004800.
The previous prime is 261360463603. The next prime is 261360463687. The reversal of 261360463650 is 56364063162.
It is a happy number.
261360463650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7468594 + ... + 7503506.
It is an arithmetic number, because the mean of its divisors is an integer number (3977577450).
Almost surely, 2261360463650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 261360463650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (381847435200).
261360463650 is an abundant number, since it is smaller than the sum of its proper divisors (502334406750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261360463650 is a wasteful number, since it uses less digits than its factorization.
261360463650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35301 (or 35296 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 42.
The spelling of 261360463650 in words is "two hundred sixty-one billion, three hundred sixty million, four hundred sixty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •