Base | Representation |
---|---|
bin | 100001011110110… |
… | …0011101001010111 |
3 | 2220021221022102101 |
4 | 1002331203221113 |
5 | 4300044324142 |
6 | 303251022531 |
7 | 36561011002 |
oct | 10275435127 |
9 | 2807838371 |
10 | 1123433047 |
11 | 52716a970 |
12 | 27429aa47 |
13 | 14b9968a9 |
14 | a92bc539 |
15 | 689640b7 |
hex | 42f63a57 |
1123433047 has 8 divisors (see below), whose sum is σ = 1228360320. Its totient is φ = 1018971960.
The previous prime is 1123433023. The next prime is 1123433063. The reversal of 1123433047 is 7403343211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123433047 is a prime.
It is a super-2 number, since 2×11234330472 = 2524203622183408418, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123433347) 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 in 7 ways as a sum of consecutive naturals, for example, 111493 + ... + 121150.
It is an arithmetic number, because the mean of its divisors is an integer number (153545040).
Almost surely, 21123433047 is an apocalyptic number.
1123433047 is a deficient number, since it is larger than the sum of its proper divisors (104927273).
1123433047 is a wasteful number, since it uses less digits than its factorization.
1123433047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233093.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 1123433047 is about 33517.6527668630. The cubic root of 1123433047 is about 1039.5588140389.
Adding to 1123433047 its reverse (7403343211), we get a palindrome (8526776258).
The spelling of 1123433047 in words is "one billion, one hundred twenty-three million, four hundred thirty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •