Base | Representation |
---|---|
bin | 111011011100100111010100… |
… | …110011010010101100001100 |
3 | 1021021201111000200211012111001 |
4 | 323130213110303102230030 |
5 | 233232103340243100400 |
6 | 2324020552302110044 |
7 | 106033135226461645 |
oct | 7334472463225414 |
9 | 1237644020735431 |
10 | 261451114425100 |
11 | 76340882092876 |
12 | 253a6b8927b324 |
13 | b2b6971345692 |
14 | 487c4312ac6cc |
15 | 2035e243cba6a |
hex | edc9d4cd2b0c |
261451114425100 has 36 divisors (see below), whose sum is σ = 567349629355264. Its totient is φ = 104580314700480.
The previous prime is 261451114425037. The next prime is 261451114425101. The reversal of 261451114425100 is 1524411154162.
It is a self number, because there is not a number n which added to its sum of digits gives 261451114425100.
It is not an unprimeable number, because it can be changed into a prime (261451114425101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 136476469 + ... + 138378931.
Almost surely, 2261451114425100 is an apocalyptic number.
261451114425100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
261451114425100 is an abundant number, since it is smaller than the sum of its proper divisors (305898514930164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261451114425100 is a wasteful number, since it uses less digits than its factorization.
261451114425100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276754 (or 3276747 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 37.
Adding to 261451114425100 its reverse (1524411154162), we get a palindrome (262975525579262).
The spelling of 261451114425100 in words is "two hundred sixty-one trillion, four hundred fifty-one billion, one hundred fourteen million, four hundred twenty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •