Base | Representation |
---|---|
bin | 11110100010111100110… |
… | …00101011110101000001 |
3 | 10201100002022221011122110 |
4 | 33101132120223311001 |
5 | 114143442210041010 |
6 | 2122054213525533 |
7 | 135553651654521 |
oct | 17213630536501 |
9 | 3640068834573 |
10 | 1049555549505 |
11 | 375128822791 |
12 | 14b4b20438a9 |
13 | 77c84c327b8 |
14 | 38b27b21681 |
15 | 1c47c0b7120 |
hex | f45e62bd41 |
1049555549505 has 16 divisors (see below), whose sum is σ = 1679563733760. Its totient is φ = 559671341568.
The previous prime is 1049555549501. The next prime is 1049555549509. The reversal of 1049555549505 is 5059455559401.
It is an interprime number because it is at equal distance from previous prime (1049555549501) and next prime (1049555549509).
It is not a de Polignac number, because 1049555549505 - 22 = 1049555549501 is a prime.
It is a super-2 number, since 2×10495555495052 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1049555549501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5631385 + ... + 5814774.
It is an arithmetic number, because the mean of its divisors is an integer number (104972733360).
Almost surely, 21049555549505 is an apocalyptic number.
1049555549505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1049555549505 is a deficient number, since it is larger than the sum of its proper divisors (630008184255).
1049555549505 is a wasteful number, since it uses less digits than its factorization.
1049555549505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11452280.
The product of its (nonzero) digits is 20250000, while the sum is 57.
The spelling of 1049555549505 in words is "one trillion, forty-nine billion, five hundred fifty-five million, five hundred forty-nine thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •