Base | Representation |
---|---|
bin | 100000111001010110100… |
… | …011001001001111111111 |
3 | 22000010000102211222001222 |
4 | 200321112203021033333 |
5 | 244014204320214244 |
6 | 4450301343223555 |
7 | 322215616122242 |
oct | 40712643111777 |
9 | 8003012758058 |
10 | 2260604851199 |
11 | 7a1798560772 |
12 | 306153ba7bbb |
13 | 135235717436 |
14 | 7b5b18b1259 |
15 | 3dc0bd2ebee |
hex | 20e568c93ff |
2260604851199 has 32 divisors (see below), whose sum is σ = 2344204800000. Its totient is φ = 2178940409568.
The previous prime is 2260604851187. The next prime is 2260604851259. The reversal of 2260604851199 is 9911584060622.
It is a cyclic number.
It is not a de Polignac number, because 2260604851199 - 28 = 2260604850943 is a prime.
It is a super-2 number, since 2×22606048511992 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2260604851199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2260604841199) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 850169732 + ... + 850172390.
It is an arithmetic number, because the mean of its divisors is an integer number (73256400000).
Almost surely, 22260604851199 is an apocalyptic number.
2260604851199 is a deficient number, since it is larger than the sum of its proper divisors (83599948801).
2260604851199 is a wasteful number, since it uses less digits than its factorization.
2260604851199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3995.
The product of its (nonzero) digits is 1866240, while the sum is 53.
The spelling of 2260604851199 in words is "two trillion, two hundred sixty billion, six hundred four million, eight hundred fifty-one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •