Base | Representation |
---|---|
bin | 11000010100011101… |
… | …10010011010010111 |
3 | 1020200221012111020100 |
4 | 30022032302122113 |
5 | 203214434104201 |
6 | 5555331105143 |
7 | 641360564022 |
oct | 141216623227 |
9 | 36627174210 |
10 | 13056550551 |
11 | 55a009a750 |
12 | 26447421b3 |
13 | 1301011875 |
14 | 8bc08a1b9 |
15 | 5163c2886 |
hex | 30a3b2697 |
13056550551 has 24 divisors (see below), whose sum is σ = 20577997440. Its totient is φ = 7911507600.
The previous prime is 13056550541. The next prime is 13056550567. The reversal of 13056550551 is 15505565031.
13056550551 is a `hidden beast` number, since 1 + 3 + 0 + 56 + 5 + 50 + 551 = 666.
13056550551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13056550551 - 214 = 13056534167 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13056550541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 680670 + ... + 699588.
It is an arithmetic number, because the mean of its divisors is an integer number (857416560).
Almost surely, 213056550551 is an apocalyptic number.
13056550551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13056550551 is a deficient number, since it is larger than the sum of its proper divisors (7521446889).
13056550551 is a wasteful number, since it uses less digits than its factorization.
13056550551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25907 (or 25904 counting only the distinct ones).
The product of its (nonzero) digits is 56250, while the sum is 36.
The spelling of 13056550551 in words is "thirteen billion, fifty-six million, five hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •