Base | Representation |
---|---|
bin | 10011100100100100110… |
… | …100100000011000100101 |
3 | 11202120112100121101111002 |
4 | 103210210310200120211 |
5 | 134013420240220212 |
6 | 2505505201323045 |
7 | 166111633455245 |
oct | 23444464403045 |
9 | 4676470541432 |
10 | 1344942507557 |
11 | 479428a8a320 |
12 | 1987aa636485 |
13 | 99a9b128a8c |
14 | 4914a32db25 |
15 | 24eb97a8ac2 |
hex | 13924d20625 |
1344942507557 has 4 divisors (see below), whose sum is σ = 1467210008256. Its totient is φ = 1222675006860.
The previous prime is 1344942507547. The next prime is 1344942507613. The reversal of 1344942507557 is 7557052494431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1344942507557 - 24 = 1344942507541 is a prime.
It is a super-2 number, since 2×13449425075572 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1344942507547) 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, 61133750333 + ... + 61133750354.
It is an arithmetic number, because the mean of its divisors is an integer number (366802502064).
Almost surely, 21344942507557 is an apocalyptic number.
It is an amenable number.
1344942507557 is a deficient number, since it is larger than the sum of its proper divisors (122267500699).
1344942507557 is a wasteful number, since it uses less digits than its factorization.
1344942507557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122267500698.
The product of its (nonzero) digits is 21168000, while the sum is 56.
The spelling of 1344942507557 in words is "one trillion, three hundred forty-four billion, nine hundred forty-two million, five hundred seven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •