Base | Representation |
---|---|
bin | 10011100011111011001… |
… | …010001010011000011011 |
3 | 11202111201122101020100111 |
4 | 103203323022022120123 |
5 | 134011002321312111 |
6 | 2505311552145151 |
7 | 166055415401362 |
oct | 23437312123033 |
9 | 4674648336314 |
10 | 1344243541531 |
11 | 4790aa486850 |
12 | 1986345381b7 |
13 | 999b938c207 |
14 | 490c15847d9 |
15 | 24e7823ca21 |
hex | 138fb28a61b |
1344243541531 has 8 divisors (see below), whose sum is σ = 1466455891824. Its totient is φ = 1222032589920.
The previous prime is 1344243541519. The next prime is 1344243541541. The reversal of 1344243541531 is 1351453424431.
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 1344243541531 - 229 = 1343706670619 is a prime.
It is a super-2 number, since 2×13442435415312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1344243541541) 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, 3581185 + ... + 3938701.
It is an arithmetic number, because the mean of its divisors is an integer number (183306986478).
Almost surely, 21344243541531 is an apocalyptic number.
1344243541531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1344243541531 is a deficient number, since it is larger than the sum of its proper divisors (122212350293).
1344243541531 is a wasteful number, since it uses less digits than its factorization.
1344243541531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 699341.
The product of its digits is 345600, while the sum is 40.
Adding to 1344243541531 its reverse (1351453424431), we get a palindrome (2695696965962).
The spelling of 1344243541531 in words is "one trillion, three hundred forty-four billion, two hundred forty-three million, five hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •