Base | Representation |
---|---|
bin | 1100000010101011111000… |
… | …1100000101001001110111 |
3 | 1201212202110212210110121222 |
4 | 3000222332030011021313 |
5 | 3213412043142403101 |
6 | 44054300051500555 |
7 | 2534402324312426 |
oct | 300527614051167 |
9 | 51782425713558 |
10 | 13240280044151 |
11 | 4245197a03286 |
12 | 159a07abb775b |
13 | 75072608b634 |
14 | 33ab939712bd |
15 | 17e623eae01b |
hex | c0abe305277 |
13240280044151 has 8 divisors (see below), whose sum is σ = 13948295550000. Its totient is φ = 12533380404480.
The previous prime is 13240280044129. The next prime is 13240280044333. The reversal of 13240280044151 is 15144008204231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13240280044151 is a prime.
It is a super-3 number, since 3×132402800441513 (a number of 40 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 (13240280044111) 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, 278942180 + ... + 278989641.
It is an arithmetic number, because the mean of its divisors is an integer number (1743536943750).
Almost surely, 213240280044151 is an apocalyptic number.
13240280044151 is a deficient number, since it is larger than the sum of its proper divisors (708015505849).
13240280044151 is a wasteful number, since it uses less digits than its factorization.
13240280044151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557933089.
The product of its (nonzero) digits is 30720, while the sum is 35.
Adding to 13240280044151 its reverse (15144008204231), we get a palindrome (28384288248382).
The spelling of 13240280044151 in words is "thirteen trillion, two hundred forty billion, two hundred eighty million, forty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •