Base | Representation |
---|---|
bin | 100010001111100… |
… | …1100101010111011 |
3 | 2222002002201112112 |
4 | 1010133030222323 |
5 | 4323122412201 |
6 | 310003402535 |
7 | 40321404632 |
oct | 10437145273 |
9 | 2862081475 |
10 | 1149029051 |
11 | 53a662595 |
12 | 28098344b |
13 | 154089161 |
14 | ac862519 |
15 | 6ad1d0bb |
hex | 447ccabb |
1149029051 has 2 divisors, whose sum is σ = 1149029052. Its totient is φ = 1149029050.
The previous prime is 1149029041. The next prime is 1149029107. The reversal of 1149029051 is 1509209411.
It is a weak prime.
It is an emirp because it is prime and its reverse (1509209411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1149029051 - 26 = 1149028987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1149028999 and 1149029017.
It is not a weakly prime, because it can be changed into another prime (1149029041) 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 as a sum of consecutive naturals, namely, 574514525 + 574514526.
It is an arithmetic number, because the mean of its divisors is an integer number (574514526).
Almost surely, 21149029051 is an apocalyptic number.
1149029051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1149029051 is an equidigital number, since it uses as much as digits as its factorization.
1149029051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 32.
The square root of 1149029051 is about 33897.3310306284. The cubic root of 1149029051 is about 1047.3946141721.
The spelling of 1149029051 in words is "one billion, one hundred forty-nine million, twenty-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •