Base | Representation |
---|---|
bin | 10100111000000111011… |
… | …010001110000100100101 |
3 | 12002011001202122101111102 |
4 | 110320013122032010211 |
5 | 142001122202001012 |
6 | 3015022134445445 |
7 | 205435541421203 |
oct | 24700732160445 |
9 | 5064052571442 |
10 | 1434643390757 |
11 | 50347987a545 |
12 | 1b2063203885 |
13 | a5394c9c265 |
14 | 4d619608073 |
15 | 274b974d2c2 |
hex | 14e0768e125 |
1434643390757 has 8 divisors (see below), whose sum is σ = 1436403040632. Its totient is φ = 1432884510400.
The previous prime is 1434643390751. The next prime is 1434643390871. The reversal of 1434643390757 is 7570933464341.
It is a Cunningham number, because it is equal to 11977662+1.
It can be written as a sum of positive squares in 4 ways, for example, as 175757146756 + 1258886244001 = 419234^2 + 1122001^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1434643390757 - 26 = 1434643390693 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 (1434643390751) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3583907 + ... + 3964047.
It is an arithmetic number, because the mean of its divisors is an integer number (179550380079).
Almost surely, 21434643390757 is an apocalyptic number.
It is an amenable number.
1434643390757 is a deficient number, since it is larger than the sum of its proper divisors (1759649875).
1434643390757 is a wasteful number, since it uses less digits than its factorization.
1434643390757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384759.
The product of its (nonzero) digits is 22861440, while the sum is 56.
The spelling of 1434643390757 in words is "one trillion, four hundred thirty-four billion, six hundred forty-three million, three hundred ninety thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •