Base | Representation |
---|---|
bin | 101010101101100… |
… | …0000001111010000 |
3 | 10200212201011112122 |
4 | 1111123000033100 |
5 | 10413341022344 |
6 | 354113113412 |
7 | 50341336133 |
oct | 12533001720 |
9 | 3625634478 |
10 | 1433142224 |
11 | 675a75a68 |
12 | 33bb58868 |
13 | 19abb3a67 |
14 | d849c21a |
15 | 85c3eaee |
hex | 556c03d0 |
1433142224 has 10 divisors (see below), whose sum is σ = 2776713090. Its totient is φ = 716571104.
The previous prime is 1433142223. The next prime is 1433142233. The reversal of 1433142224 is 4222413341.
It can be written as a sum of positive squares in only one way, i.e., 1167452224 + 265690000 = 34168^2 + 16300^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1433142193 and 1433142202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1433142223) 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, 44785679 + ... + 44785710.
It is an arithmetic number, because the mean of its divisors is an integer number (277671309).
Almost surely, 21433142224 is an apocalyptic number.
It is an amenable number.
1433142224 is a deficient number, since it is larger than the sum of its proper divisors (1343570866).
1433142224 is an equidigital number, since it uses as much as digits as its factorization.
1433142224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89571397 (or 89571391 counting only the distinct ones).
The product of its digits is 4608, while the sum is 26.
The square root of 1433142224 is about 37856.8649520797. The cubic root of 1433142224 is about 1127.4477663391.
Adding to 1433142224 its reverse (4222413341), we get a palindrome (5655555565).
The spelling of 1433142224 in words is "one billion, four hundred thirty-three million, one hundred forty-two thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •