Base | Representation |
---|---|
bin | 10000101111001110100… |
… | …001000110001010001001 |
3 | 11001221220212211110122100 |
4 | 100233032201012022021 |
5 | 122321123042104010 |
6 | 2240223152544013 |
7 | 146046356420262 |
oct | 20571641061211 |
9 | 4057825743570 |
10 | 1150221050505 |
11 | 40389588460a |
12 | 166b06852009 |
13 | 846085928c7 |
14 | 3d9572d9969 |
15 | 1edbe95c2c0 |
hex | 10bce846289 |
1150221050505 has 96 divisors (see below), whose sum is σ = 2136703196160. Its totient is φ = 571116510720.
The previous prime is 1150221050501. The next prime is 1150221050557. The reversal of 1150221050505 is 5050501220511.
1150221050505 is a `hidden beast` number, since 1 + 1 + 50 + 2 + 2 + 105 + 0 + 505 = 666.
It is not a de Polignac number, because 1150221050505 - 22 = 1150221050501 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1150221050501) 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 95 ways as a sum of consecutive naturals, for example, 11154714 + ... + 11257356.
It is an arithmetic number, because the mean of its divisors is an integer number (22257324960).
Almost surely, 21150221050505 is an apocalyptic number.
1150221050505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1150221050505 is a deficient number, since it is larger than the sum of its proper divisors (986482145655).
1150221050505 is a wasteful number, since it uses less digits than its factorization.
1150221050505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102991 (or 102988 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 27.
The spelling of 1150221050505 in words is "one trillion, one hundred fifty billion, two hundred twenty-one million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •