Base | Representation |
---|---|
bin | 1011111011010110111100… |
… | …1111001010101001100000 |
3 | 1201102201120011220212100201 |
4 | 2332311233033022221200 |
5 | 3204331243224321230 |
6 | 43520401155354544 |
7 | 2522325043435123 |
oct | 276655717125140 |
9 | 51381504825321 |
10 | 13114401401440 |
11 | 41a6871776959 |
12 | 15797aa5b2a54 |
13 | 7418b4cb9171 |
14 | 334a519aa3ba |
15 | 17b207d935ca |
hex | bed6f3caa60 |
13114401401440 has 96 divisors (see below), whose sum is σ = 33203630496960. Its totient is φ = 4882070882304.
The previous prime is 13114401401393. The next prime is 13114401401467. The reversal of 13114401401440 is 4410410441131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13114401401399 and 13114401401408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48021895 + ... + 48294214.
It is an arithmetic number, because the mean of its divisors is an integer number (345871151010).
Almost surely, 213114401401440 is an apocalyptic number.
13114401401440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13114401401440 is an abundant number, since it is smaller than the sum of its proper divisors (20089229095520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13114401401440 is a wasteful number, since it uses less digits than its factorization.
13114401401440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96316184 (or 96316176 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 13114401401440 its reverse (4410410441131), we get a palindrome (17524811842571).
The spelling of 13114401401440 in words is "thirteen trillion, one hundred fourteen billion, four hundred one million, four hundred one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •