Base | Representation |
---|---|
bin | 10011010110111000100… |
… | …010110010111000100100 |
3 | 11201011120210011121201110 |
4 | 103112320202302320210 |
5 | 133243313200223044 |
6 | 2455034305425020 |
7 | 165051420064620 |
oct | 23267042627044 |
9 | 4634523147643 |
10 | 1330241023524 |
11 | 473174418816 |
12 | 19598703b170 |
13 | 985973ab1ba |
14 | 48553a14180 |
15 | 24908cad6b9 |
hex | 135b88b2e24 |
1330241023524 has 72 divisors (see below), whose sum is σ = 3768249150400. Its totient is φ = 357711865344.
The previous prime is 1330241023523. The next prime is 1330241023571. The reversal of 1330241023524 is 4253201420331.
It is a junction number, because it is equal to n+sod(n) for n = 1330241023491 and 1330241023500.
It is not an unprimeable number, because it can be changed into a prime (1330241023523) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 27373999 + ... + 27422550.
Almost surely, 21330241023524 is an apocalyptic number.
1330241023524 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1330241023524 is an abundant number, since it is smaller than the sum of its proper divisors (2438008126876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330241023524 is a wasteful number, since it uses less digits than its factorization.
1330241023524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54796597 (or 54796578 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 1330241023524 its reverse (4253201420331), we get a palindrome (5583442443855).
The spelling of 1330241023524 in words is "one trillion, three hundred thirty billion, two hundred forty-one million, twenty-three thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •