Base | Representation |
---|---|
bin | 10011000101010111100… |
… | …001001100110111101100 |
3 | 11122101001001012122011102 |
4 | 103011113201030313230 |
5 | 132441303414042130 |
6 | 2442244131542232 |
7 | 163514353343252 |
oct | 23052741146754 |
9 | 4571031178142 |
10 | 1311433346540 |
11 | 4661a2a31719 |
12 | 1921b845a978 |
13 | 9688aa3a655 |
14 | 4768bc205d2 |
15 | 241a7a63645 |
hex | 1315784cdec |
1311433346540 has 96 divisors (see below), whose sum is σ = 2779197087744. Its totient is φ = 519805820160.
The previous prime is 1311433346533. The next prime is 1311433346543. The reversal of 1311433346540 is 456433341131.
It is a junction number, because it is equal to n+sod(n) for n = 1311433346494 and 1311433346503.
It is not an unprimeable number, because it can be changed into a prime (1311433346543) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1206469877 + ... + 1206470963.
It is an arithmetic number, because the mean of its divisors is an integer number (28949969664).
Almost surely, 21311433346540 is an apocalyptic number.
1311433346540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1311433346540 is an abundant number, since it is smaller than the sum of its proper divisors (1467763741204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311433346540 is a wasteful number, since it uses less digits than its factorization.
1311433346540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367 (or 2365 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 1311433346540 its reverse (456433341131), we get a palindrome (1767866687671).
The spelling of 1311433346540 in words is "one trillion, three hundred eleven billion, four hundred thirty-three million, three hundred forty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •