Base | Representation |
---|---|
bin | 100001110001011… |
… | …1110100001000100 |
3 | 2220222101200101002 |
4 | 1003202332201010 |
5 | 4310102224221 |
6 | 304241152432 |
7 | 40040254544 |
oct | 10342764104 |
9 | 2828350332 |
10 | 1133242436 |
11 | 53175a8a7 |
12 | 27762b718 |
13 | 150a1c771 |
14 | aa713324 |
15 | 6975080b |
hex | 438be844 |
1133242436 has 6 divisors (see below), whose sum is σ = 1983174270. Its totient is φ = 566621216.
The previous prime is 1133242433. The next prime is 1133242471. The reversal of 1133242436 is 6342423311.
It can be written as a sum of positive squares in only one way, i.e., 1100248900 + 32993536 = 33170^2 + 5744^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1133242399 and 1133242408.
It is not an unprimeable number, because it can be changed into a prime (1133242433) 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 as a sum of consecutive naturals, namely, 141655301 + ... + 141655308.
It is an arithmetic number, because the mean of its divisors is an integer number (330529045).
Almost surely, 21133242436 is an apocalyptic number.
It is an amenable number.
1133242436 is a deficient number, since it is larger than the sum of its proper divisors (849931834).
1133242436 is a wasteful number, since it uses less digits than its factorization.
1133242436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283310613 (or 283310611 counting only the distinct ones).
The product of its digits is 10368, while the sum is 29.
The square root of 1133242436 is about 33663.6664075677. Note that the first 3 decimals coincide. The cubic root of 1133242436 is about 1042.5757272174.
Adding to 1133242436 its reverse (6342423311), we get a palindrome (7475665747).
The spelling of 1133242436 in words is "one billion, one hundred thirty-three million, two hundred forty-two thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •