Base | Representation |
---|---|
bin | 11000100000111000… |
… | …11000010101010000 |
3 | 1020222012022202002200 |
4 | 30100130120111100 |
5 | 203423124331130 |
6 | 10013533043200 |
7 | 644064521235 |
oct | 142034302520 |
9 | 36865282080 |
10 | 13160777040 |
11 | 5643a08644 |
12 | 2673626500 |
13 | 13197a5048 |
14 | 8cbc5b78c |
15 | 52060e760 |
hex | 310718550 |
13160777040 has 60 divisors (see below), whose sum is σ = 44198278644. Its totient is φ = 3509540352.
The previous prime is 13160777033. The next prime is 13160777111. The reversal of 13160777040 is 4077706131.
13160777040 is a `hidden beast` number, since 1 + 3 + 1 + 607 + 7 + 7 + 0 + 40 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3199938624 + 9960838416 = 56568^2 + 99804^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 13160776986 and 13160777004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9138709 + ... + 9140148.
Almost surely, 213160777040 is an apocalyptic number.
13160777040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13160777040 is an abundant number, since it is smaller than the sum of its proper divisors (31037501604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13160777040 is a wasteful number, since it uses less digits than its factorization.
13160777040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18278876 (or 18278867 counting only the distinct ones).
The product of its (nonzero) digits is 24696, while the sum is 36.
The spelling of 13160777040 in words is "thirteen billion, one hundred sixty million, seven hundred seventy-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •