Base | Representation |
---|---|
bin | 11001001110101000… |
… | …00001001011111011 |
3 | 1021221221021220121121 |
4 | 30213110001023323 |
5 | 210214340223201 |
6 | 10120000450111 |
7 | 656434006432 |
oct | 144724011373 |
9 | 37857256547 |
10 | 13544461051 |
11 | 582054a070 |
12 | 2760019937 |
13 | 137b122cc4 |
14 | 926bb6119 |
15 | 54414d9a1 |
hex | 3275012fb |
13544461051 has 16 divisors (see below), whose sum is σ = 15649698528. Its totient is φ = 11585318400.
The previous prime is 13544461037. The next prime is 13544461093. The reversal of 13544461051 is 15016444531.
13544461051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13544461051 - 217 = 13544329979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13544460998 and 13544461016.
It is not an unprimeable number, because it can be changed into a prime (13544461451) 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 15 ways as a sum of consecutive naturals, for example, 742921 + ... + 760933.
It is an arithmetic number, because the mean of its divisors is an integer number (978106158).
Almost surely, 213544461051 is an apocalyptic number.
13544461051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13544461051 is a deficient number, since it is larger than the sum of its proper divisors (2105237477).
13544461051 is a wasteful number, since it uses less digits than its factorization.
13544461051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22062.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 13544461051 in words is "thirteen billion, five hundred forty-four million, four hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •