Base | Representation |
---|---|
bin | 100000111010000001001… |
… | …011010001011010100101 |
3 | 22000011212021112222021202 |
4 | 200322001023101122211 |
5 | 244022140410412402 |
6 | 4450500331452245 |
7 | 322242421653410 |
oct | 40720113213245 |
9 | 8004767488252 |
10 | 2261320013477 |
11 | 7a2025216778 |
12 | 3063135b7085 |
13 | 13531a934c95 |
14 | 7b63c874b77 |
15 | 3dc4e9e9b02 |
hex | 20e812d16a5 |
2261320013477 has 16 divisors (see below), whose sum is σ = 2654749117440. Its totient is φ = 1885507901568.
The previous prime is 2261320013443. The next prime is 2261320013521. The reversal of 2261320013477 is 7743100231622.
It is a cyclic number.
It is not a de Polignac number, because 2261320013477 - 26 = 2261320013413 is a prime.
It is a super-2 number, since 2×22613200134772 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2261320013477.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2261320013417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 408428 + ... + 2165514.
It is an arithmetic number, because the mean of its divisors is an integer number (165921819840).
Almost surely, 22261320013477 is an apocalyptic number.
It is an amenable number.
2261320013477 is a deficient number, since it is larger than the sum of its proper divisors (393429103963).
2261320013477 is a wasteful number, since it uses less digits than its factorization.
2261320013477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1762100.
The product of its (nonzero) digits is 84672, while the sum is 38.
The spelling of 2261320013477 in words is "two trillion, two hundred sixty-one billion, three hundred twenty million, thirteen thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •