Base | Representation |
---|---|
bin | 10011000101010111010… |
… | …100111010101101110111 |
3 | 11122101000211011001001000 |
4 | 103011113110322231313 |
5 | 132441302103021310 |
6 | 2442243534534343 |
7 | 163514314102251 |
oct | 23052724725567 |
9 | 4571024131030 |
10 | 1311430126455 |
11 | 4661a1132399 |
12 | 1921b73673b3 |
13 | 9688a180a87 |
14 | 4768b622cd1 |
15 | 241a76294c0 |
hex | 1315753ab77 |
1311430126455 has 64 divisors (see below), whose sum is σ = 2479645163520. Its totient is φ = 655334281728.
The previous prime is 1311430126453. The next prime is 1311430126549. The reversal of 1311430126455 is 5546210341131.
1311430126455 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 4 + 3 + 0 + 1 + 2 + 645 + 5 = 666.
It is not a de Polignac number, because 1311430126455 - 21 = 1311430126453 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311430126453) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 769447 + ... + 1793016.
It is an arithmetic number, because the mean of its divisors is an integer number (38744455680).
Almost surely, 21311430126455 is an apocalyptic number.
1311430126455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1311430126455 is a deficient number, since it is larger than the sum of its proper divisors (1168215037065).
1311430126455 is a wasteful number, since it uses less digits than its factorization.
1311430126455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2562717 (or 2562711 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 1311430126455 its reverse (5546210341131), we get a palindrome (6857640467586).
The spelling of 1311430126455 in words is "one trillion, three hundred eleven billion, four hundred thirty million, one hundred twenty-six thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •