Base | Representation |
---|---|
bin | 10100110110110011111… |
… | …101110101110011100001 |
3 | 12002000110012101122101022 |
4 | 110312303331311303201 |
5 | 141440240310124101 |
6 | 3014231205015225 |
7 | 205356052152131 |
oct | 24666375656341 |
9 | 5060405348338 |
10 | 1433243442401 |
11 | 502920616631 |
12 | 1b19323b4515 |
13 | a5200c3b154 |
14 | 4d52570aac1 |
15 | 274368b8a1b |
hex | 14db3f75ce1 |
1433243442401 has 4 divisors (see below), whose sum is σ = 1482665630100. Its totient is φ = 1383821254704.
The previous prime is 1433243442377. The next prime is 1433243442403. The reversal of 1433243442401 is 1042443423341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 706862244001 + 726381198400 = 840751^2 + 852280^2 .
It is a cyclic number.
It is not a de Polignac number, because 1433243442401 - 234 = 1416063573217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1433243442403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24711093806 + ... + 24711093863.
It is an arithmetic number, because the mean of its divisors is an integer number (370666407525).
Almost surely, 21433243442401 is an apocalyptic number.
It is an amenable number.
1433243442401 is a deficient number, since it is larger than the sum of its proper divisors (49422187699).
1433243442401 is an equidigital number, since it uses as much as digits as its factorization.
1433243442401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49422187698.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 1433243442401 its reverse (1042443423341), we get a palindrome (2475686865742).
The spelling of 1433243442401 in words is "one trillion, four hundred thirty-three billion, two hundred forty-three million, four hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •