Base | Representation |
---|---|
bin | 100010010001101… |
… | …1010010011000011 |
3 | 2222011011211110221 |
4 | 1010203122103003 |
5 | 4323413232233 |
6 | 310043203511 |
7 | 40333654504 |
oct | 10443322303 |
9 | 2864154427 |
10 | 1150133443 |
11 | 540247308 |
12 | 281216597 |
13 | 154384a44 |
14 | aca6cbab |
15 | 6ae8a42d |
hex | 448da4c3 |
1150133443 has 4 divisors (see below), whose sum is σ = 1171834128. Its totient is φ = 1128432760.
The previous prime is 1150133393. The next prime is 1150133461. The reversal of 1150133443 is 3443310511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150133443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1150133143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10850263 + ... + 10850368.
It is an arithmetic number, because the mean of its divisors is an integer number (292958532).
Almost surely, 21150133443 is an apocalyptic number.
1150133443 is a deficient number, since it is larger than the sum of its proper divisors (21700685).
1150133443 is an equidigital number, since it uses as much as digits as its factorization.
1150133443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21700684.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1150133443 is about 33913.6173682490. The cubic root of 1150133443 is about 1047.7300753252.
Adding to 1150133443 its reverse (3443310511), we get a palindrome (4593443954).
It can be divided in two parts, 11501 and 33443, that added together give a palindrome (44944).
The spelling of 1150133443 in words is "one billion, one hundred fifty million, one hundred thirty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •