Base | Representation |
---|---|
bin | 1011111110001101100000… |
… | …1010111101011001111000 |
3 | 1201121102001102202011122020 |
4 | 2333203120022331121320 |
5 | 3211132124033442202 |
6 | 43555104021554440 |
7 | 2526011325336243 |
oct | 277433012753170 |
9 | 51542042664566 |
10 | 13163406546552 |
11 | 421562990a789 |
12 | 15871a6275a20 |
13 | 7463c4900852 |
14 | 33718012c25a |
15 | 17c6252215bc |
hex | bf8d82bd678 |
13163406546552 has 32 divisors (see below), whose sum is σ = 33359317964880. Its totient is φ = 4327695302400.
The previous prime is 13163406546491. The next prime is 13163406546553. The reversal of 13163406546552 is 25564560436131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13163406546495 and 13163406546504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13163406546553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3756678199 + ... + 3756681702.
Almost surely, 213163406546552 is an apocalyptic number.
13163406546552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13163406546552 is an abundant number, since it is smaller than the sum of its proper divisors (20195911418328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13163406546552 is a wasteful number, since it uses less digits than its factorization.
13163406546552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7513359983 (or 7513359979 counting only the distinct ones).
The product of its (nonzero) digits is 7776000, while the sum is 51.
The spelling of 13163406546552 in words is "thirteen trillion, one hundred sixty-three billion, four hundred six million, five hundred forty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •