Base | Representation |
---|---|
bin | 10011100011111011110… |
… | …101111000000111011011 |
3 | 11202111202102221102212011 |
4 | 103203323311320013123 |
5 | 134011013240013201 |
6 | 2505313041530351 |
7 | 166055614660144 |
oct | 23437365700733 |
9 | 4674672842764 |
10 | 1344255001051 |
11 | 4791059a3526 |
12 | 1986383439b7 |
13 | 999bb8721b1 |
14 | 490c2cc8acb |
15 | 24e79253151 |
hex | 138fbd781db |
1344255001051 has 2 divisors, whose sum is σ = 1344255001052. Its totient is φ = 1344255001050.
The previous prime is 1344255001049. The next prime is 1344255001079. The reversal of 1344255001051 is 1501005524431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1344255001051 - 21 = 1344255001049 is a prime.
It is a super-2 number, since 2×13442550010512 (a number of 25 digits) contains 22 as substring.
Together with 1344255001049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1344256001051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672127500525 + 672127500526.
It is an arithmetic number, because the mean of its divisors is an integer number (672127500526).
Almost surely, 21344255001051 is an apocalyptic number.
1344255001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1344255001051 is an equidigital number, since it uses as much as digits as its factorization.
1344255001051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 1344255001051 in words is "one trillion, three hundred forty-four billion, two hundred fifty-five million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •