Base | Representation |
---|---|
bin | 111011011101110101100100… |
… | …010011000100100000110010 |
3 | 1021022000111212121221102111210 |
4 | 323131311210103010200302 |
5 | 233234442414311314041 |
6 | 2324123324531420550 |
7 | 106042201144436202 |
oct | 7335654423044062 |
9 | 1238014777842453 |
10 | 261535126276146 |
11 | 76373473637a28 |
12 | 253bb314754756 |
13 | b2c186c68b148 |
14 | 4882520ba4402 |
15 | 20381debb2016 |
hex | eddd644c4832 |
261535126276146 has 32 divisors (see below), whose sum is σ = 530568158879808. Its totient is φ = 85935885696000.
The previous prime is 261535126276129. The next prime is 261535126276163. The reversal of 261535126276146 is 641672621535162.
It is an interprime number because it is at equal distance from previous prime (261535126276129) and next prime (261535126276163).
It is a super-2 number, since 2×2615351262761462 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 895019395 + ... + 895311558.
It is an arithmetic number, because the mean of its divisors is an integer number (16580254964994).
Almost surely, 2261535126276146 is an apocalyptic number.
261535126276146 is an abundant number, since it is smaller than the sum of its proper divisors (269033032603662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261535126276146 is a wasteful number, since it uses less digits than its factorization.
261535126276146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1790331306.
The product of its digits is 21772800, while the sum is 57.
The spelling of 261535126276146 in words is "two hundred sixty-one trillion, five hundred thirty-five billion, one hundred twenty-six million, two hundred seventy-six thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •