Base | Representation |
---|---|
bin | 10011100100010001000… |
… | …000101000001110000101 |
3 | 11202112200012012102100212 |
4 | 103210101000220032011 |
5 | 134012230144003221 |
6 | 2505412205445205 |
7 | 166100456422565 |
oct | 23442100501605 |
9 | 4675605172325 |
10 | 1344610141061 |
11 | 479278409470 |
12 | 198717270805 |
13 | 99a47307b05 |
14 | 49118132da5 |
15 | 24e9a504b5b |
hex | 13911028385 |
1344610141061 has 8 divisors (see below), whose sum is σ = 1466855829984. Its totient is φ = 1222365852720.
The previous prime is 1344610141037. The next prime is 1344610141079. The reversal of 1344610141061 is 1601410164431.
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 1344610141061 - 226 = 1344543032197 is a prime.
It is a super-3 number, since 3×13446101410613 (a number of 37 digits) contains 333 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 (1344610140061) 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, 3458051 + ... + 3827183.
It is an arithmetic number, because the mean of its divisors is an integer number (183356978748).
Almost surely, 21344610141061 is an apocalyptic number.
1344610141061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1344610141061 is a deficient number, since it is larger than the sum of its proper divisors (122245688923).
1344610141061 is a wasteful number, since it uses less digits than its factorization.
1344610141061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700291.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 1344610141061 in words is "one trillion, three hundred forty-four billion, six hundred ten million, one hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •