Base | Representation |
---|---|
bin | 100100101101111… |
… | …1000101111001111 |
3 | 10011212022110211102 |
4 | 1021123320233033 |
5 | 10010401001210 |
6 | 322131013315 |
7 | 42350140631 |
oct | 11133705717 |
9 | 3155273742 |
10 | 1232047055 |
11 | 582505208 |
12 | 2a473a23b |
13 | 168335135 |
14 | b98b2a51 |
15 | 7326aea5 |
hex | 496f8bcf |
1232047055 has 4 divisors (see below), whose sum is σ = 1478456472. Its totient is φ = 985637640.
The previous prime is 1232047013. The next prime is 1232047057. The reversal of 1232047055 is 5507402321.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5507402321 = 3119 ⋅1765759.
It is not a de Polignac number, because 1232047055 - 226 = 1164938191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1232047057) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 123204701 + ... + 123204710.
It is an arithmetic number, because the mean of its divisors is an integer number (369614118).
Almost surely, 21232047055 is an apocalyptic number.
1232047055 is a deficient number, since it is larger than the sum of its proper divisors (246409417).
1232047055 is an equidigital number, since it uses as much as digits as its factorization.
1232047055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246409416.
The product of its (nonzero) digits is 8400, while the sum is 29.
The square root of 1232047055 is about 35100.5278450339. The cubic root of 1232047055 is about 1072.0353302824.
Adding to 1232047055 its reverse (5507402321), we get a palindrome (6739449376).
The spelling of 1232047055 in words is "one billion, two hundred thirty-two million, forty-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •