Base | Representation |
---|---|
bin | 10011101011001000101… |
… | …111111110010010110000 |
3 | 11210020201100110210022202 |
4 | 103223020233332102300 |
5 | 134122332331000224 |
6 | 2513032233322332 |
7 | 166451342156000 |
oct | 23531057762260 |
9 | 4706640423282 |
10 | 1351987750064 |
11 | 481413925296 |
12 | 19a035b663a8 |
13 | 9a651912823 |
14 | 49617ca6000 |
15 | 2527d05ceae |
hex | 13ac8bfe4b0 |
1351987750064 has 80 divisors (see below), whose sum is σ = 3076761408000. Its totient is φ = 575254483776.
The previous prime is 1351987749997. The next prime is 1351987750067. The reversal of 1351987750064 is 4600577891531.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 1351987749991 and 1351987750009.
It is not an unprimeable number, because it can be changed into a prime (1351987750067) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123332 + ... + 1648995.
It is an arithmetic number, because the mean of its divisors is an integer number (38459517600).
Almost surely, 21351987750064 is an apocalyptic number.
1351987750064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1351987750064 is an abundant number, since it is smaller than the sum of its proper divisors (1724773657936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1351987750064 is a wasteful number, since it uses less digits than its factorization.
1351987750064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1772495 (or 1772475 counting only the distinct ones).
The product of its (nonzero) digits is 6350400, while the sum is 56.
The spelling of 1351987750064 in words is "one trillion, three hundred fifty-one billion, nine hundred eighty-seven million, seven hundred fifty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •