Base | Representation |
---|---|
bin | 100010001111101… |
… | …1110101101010111 |
3 | 2222002020110212222 |
4 | 1010133132231113 |
5 | 4323132243220 |
6 | 310005132555 |
7 | 40322133221 |
oct | 10437365527 |
9 | 2862213788 |
10 | 1149102935 |
11 | 53a703052 |
12 | 2809ba15b |
13 | 1540b3986 |
14 | ac881411 |
15 | 6ad34e25 |
hex | 447deb57 |
1149102935 has 16 divisors (see below), whose sum is σ = 1389696672. Its totient is φ = 912124800.
The previous prime is 1149102887. The next prime is 1149102943. The reversal of 1149102935 is 5392019411.
It is a happy number.
It is not a de Polignac number, because 1149102935 - 210 = 1149101911 is a prime.
It is a super-2 number, since 2×11491029352 = 2640875110451228450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1149102895 and 1149102904.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 488432 + ... + 490778.
It is an arithmetic number, because the mean of its divisors is an integer number (86856042).
Almost surely, 21149102935 is an apocalyptic number.
1149102935 is a deficient number, since it is larger than the sum of its proper divisors (240593737).
1149102935 is a wasteful number, since it uses less digits than its factorization.
1149102935 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3074.
The product of its (nonzero) digits is 9720, while the sum is 35.
The square root of 1149102935 is about 33898.4208334253. The cubic root of 1149102935 is about 1047.4170632840.
The spelling of 1149102935 in words is "one billion, one hundred forty-nine million, one hundred two thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •