Base | Representation |
---|---|
bin | 10011010110101010010… |
… | …011011000010100011100 |
3 | 11201010222010121010100210 |
4 | 103112222103120110130 |
5 | 133242321014222112 |
6 | 2454554452452420 |
7 | 165042456222216 |
oct | 23265223302434 |
9 | 4633863533323 |
10 | 1330002101532 |
11 | 473061571125 |
12 | 19591b01a110 |
13 | 98559a46c40 |
14 | 4852ddbd5b6 |
15 | 248e2d16b3c |
hex | 135aa4d851c |
1330002101532 has 48 divisors (see below), whose sum is σ = 3342658864160. Its totient is φ = 409157664768.
The previous prime is 1330002101497. The next prime is 1330002101537. The reversal of 1330002101532 is 2351012000331.
It is a junction number, because it is equal to n+sod(n) for n = 1330002101499 and 1330002101508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330002101537) 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 15 ways as a sum of consecutive naturals, for example, 103308 + ... + 1634220.
Almost surely, 21330002101532 is an apocalyptic number.
1330002101532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1330002101532 is an abundant number, since it is smaller than the sum of its proper divisors (2012656762628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330002101532 is a wasteful number, since it uses less digits than its factorization.
1330002101532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1536502 (or 1536500 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 1330002101532 its reverse (2351012000331), we get a palindrome (3681014101863).
The spelling of 1330002101532 in words is "one trillion, three hundred thirty billion, two million, one hundred one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •