Base | Representation |
---|---|
bin | 100000111001011010000… |
… | …000000000000010110000 |
3 | 22000010011110210101121110 |
4 | 200321122000000002300 |
5 | 244014314130403222 |
6 | 4450311212153320 |
7 | 322220221204464 |
oct | 40713200000260 |
9 | 8003143711543 |
10 | 2260662747312 |
11 | 7a18182049a2 |
12 | 30616b468840 |
13 | 1352447088a8 |
14 | 7b5b94624a4 |
15 | 3dc11e6930c |
hex | 20e5a0000b0 |
2260662747312 has 40 divisors (see below), whose sum is σ = 6028433996800. Its totient is φ = 729246047040.
The previous prime is 2260662747269. The next prime is 2260662747313. The reversal of 2260662747312 is 2137472660622.
It is a super-2 number, since 2×22606627473122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (2260662747313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 759629812 + ... + 759632787.
It is an arithmetic number, because the mean of its divisors is an integer number (150710849920).
Almost surely, 22260662747312 is an apocalyptic number.
It is an amenable number.
2260662747312 is an abundant number, since it is smaller than the sum of its proper divisors (3767771249488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2260662747312 is a wasteful number, since it uses less digits than its factorization.
2260662747312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519262641 (or 1519262635 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 48.
The spelling of 2260662747312 in words is "two trillion, two hundred sixty billion, six hundred sixty-two million, seven hundred forty-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.047 sec. • engine limits •