Base | Representation |
---|---|
bin | 100000111001010010000… |
… | …110011101000111010000 |
3 | 22000002211020102101101210 |
4 | 200321102012131013100 |
5 | 244014031214042040 |
6 | 4450250115500120 |
7 | 322214021564064 |
oct | 40712206350720 |
9 | 8002736371353 |
10 | 2260530221520 |
11 | 7a175a41834a |
12 | 306132bb7640 |
13 | 13522311756c |
14 | 7b5a5a05aa4 |
15 | 3dc054dc480 |
hex | 20e5219d1d0 |
2260530221520 has 80 divisors (see below), whose sum is σ = 7008003459072. Its totient is φ = 602777111040.
The previous prime is 2260530221513. The next prime is 2260530221533. The reversal of 2260530221520 is 251220350622.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×22605302215202 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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, 4648305 + ... + 5111535.
Almost surely, 22260530221520 is an apocalyptic number.
2260530221520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2260530221520 is an abundant number, since it is smaller than the sum of its proper divisors (4747473237552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2260530221520 is a wasteful number, since it uses less digits than its factorization.
2260530221520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483580 (or 483574 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 2260530221520 in words is "two trillion, two hundred sixty billion, five hundred thirty million, two hundred twenty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •