Base | Representation |
---|---|
bin | 10000110011110111111… |
… | …101000000101001111110 |
3 | 11002102210122200101102121 |
4 | 100303313331000221332 |
5 | 122411333031414100 |
6 | 2242410253113154 |
7 | 146314132123366 |
oct | 20636775005176 |
9 | 4072718611377 |
10 | 1155211201150 |
11 | 405a16674656 |
12 | 167a79a887ba |
13 | 84c22383376 |
14 | 3dcabd559a6 |
15 | 200b2aba51a |
hex | 10cf7f40a7e |
1155211201150 has 24 divisors (see below), whose sum is σ = 2148721182864. Its totient is φ = 462078384000.
The previous prime is 1155211201147. The next prime is 1155211201201. The reversal of 1155211201150 is 511021125511.
It is a super-2 number, since 2×11552112011502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 6979350 + ... + 7142950.
It is an arithmetic number, because the mean of its divisors is an integer number (89530049286).
Almost surely, 21155211201150 is an apocalyptic number.
1155211201150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1155211201150 is a deficient number, since it is larger than the sum of its proper divisors (993509981714).
1155211201150 is a wasteful number, since it uses less digits than its factorization.
1155211201150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304836 (or 304831 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 25.
Adding to 1155211201150 its reverse (511021125511), we get a palindrome (1666232326661).
The spelling of 1155211201150 in words is "one trillion, one hundred fifty-five billion, two hundred eleven million, two hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •