Base | Representation |
---|---|
bin | 10011000101001100001… |
… | …000001111010100111110 |
3 | 11122100112201122002222020 |
4 | 103011030020033110332 |
5 | 132440411004104010 |
6 | 2442213144101010 |
7 | 163506543154131 |
oct | 23051410172476 |
9 | 4570481562866 |
10 | 1311242253630 |
11 | 4661050827a1 |
12 | 192164464766 |
13 | 9685a28161a |
14 | 476706ba218 |
15 | 24195db8470 |
hex | 1314c20f53e |
1311242253630 has 64 divisors (see below), whose sum is σ = 3154718069568. Its totient is φ = 348805923840.
The previous prime is 1311242253617. The next prime is 1311242253649. The reversal of 1311242253630 is 363522421131.
It is a junction number, because it is equal to n+sod(n) for n = 1311242253591 and 1311242253600.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22719610 + ... + 22777250.
It is an arithmetic number, because the mean of its divisors is an integer number (49292469837).
Almost surely, 21311242253630 is an apocalyptic number.
1311242253630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311242253630 is an abundant number, since it is smaller than the sum of its proper divisors (1843475815938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311242253630 is a wasteful number, since it uses less digits than its factorization.
1311242253630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59501.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 1311242253630 its reverse (363522421131), we get a palindrome (1674764674761).
The spelling of 1311242253630 in words is "one trillion, three hundred eleven billion, two hundred forty-two million, two hundred fifty-three thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •