Base | Representation |
---|---|
bin | 100100111111011… |
… | …1001100101000110 |
3 | 10012111120210100101 |
4 | 1021332321211012 |
5 | 10020223204132 |
6 | 323055434314 |
7 | 42521146234 |
oct | 11176714506 |
9 | 3174523311 |
10 | 1241225542 |
11 | 587704137 |
12 | 2a782599a |
13 | 16a1c9aab |
14 | babc1954 |
15 | 73e807e7 |
hex | 49fb9946 |
1241225542 has 4 divisors (see below), whose sum is σ = 1861838316. Its totient is φ = 620612770.
The previous prime is 1241225519. The next prime is 1241225543. The reversal of 1241225542 is 2455221421.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×12412255422 = 3081281692226387528, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1241225542.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1241225543) 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 as a sum of consecutive naturals, namely, 310306384 + ... + 310306387.
It is an arithmetic number, because the mean of its divisors is an integer number (465459579).
Almost surely, 21241225542 is an apocalyptic number.
1241225542 is a deficient number, since it is larger than the sum of its proper divisors (620612774).
1241225542 is an equidigital number, since it uses as much as digits as its factorization.
1241225542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 620612773.
The product of its digits is 6400, while the sum is 28.
The square root of 1241225542 is about 35231.0309528404. The cubic root of 1241225542 is about 1074.6908913320.
Adding to 1241225542 its reverse (2455221421), we get a palindrome (3696446963).
The spelling of 1241225542 in words is "one billion, two hundred forty-one million, two hundred twenty-five thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •