Base | Representation |
---|---|
bin | 100010001111101… |
… | …0011001110000011 |
3 | 2222002011002100000 |
4 | 1010133103032003 |
5 | 4323124242000 |
6 | 310004131043 |
7 | 40321546062 |
oct | 10437231603 |
9 | 2862132300 |
10 | 1149055875 |
11 | 53a680760 |
12 | 280996a83 |
13 | 154098426 |
14 | ac86c1d9 |
15 | 6ad26000 |
hex | 447d3383 |
1149055875 has 192 divisors, whose sum is σ = 2480325120. Its totient is φ = 524880000.
The previous prime is 1149055849. The next prime is 1149055903. The reversal of 1149055875 is 5785509411.
1149055875 is a `hidden beast` number, since 1 + 1 + 4 + 90 + 558 + 7 + 5 = 666.
It is not a de Polignac number, because 1149055875 - 211 = 1149053827 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 1149055875.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6348285 + ... + 6348465.
It is an arithmetic number, because the mean of its divisors is an integer number (12918360).
Almost surely, 21149055875 is an apocalyptic number.
1149055875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1149055875 is an abundant number, since it is smaller than the sum of its proper divisors (1331269245).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1149055875 is a wasteful number, since it uses less digits than its factorization.
1149055875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241 (or 219 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 45.
The square root of 1149055875 is about 33897.7266936885. The cubic root of 1149055875 is about 1047.4027645592.
The spelling of 1149055875 in words is "one billion, one hundred forty-nine million, fifty-five thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •