Base | Representation |
---|---|
bin | 11001101010101101… |
… | …00101000001010111 |
3 | 1022120100112012100011 |
4 | 30311112211001113 |
5 | 211210140410033 |
6 | 10155213301051 |
7 | 665324115301 |
oct | 146526450127 |
9 | 38510465304 |
10 | 13780013143 |
11 | 5931504916 |
12 | 2806a94787 |
13 | 13b7b77440 |
14 | 94a1b0971 |
15 | 559b7bccd |
hex | 3355a5057 |
13780013143 has 32 divisors (see below), whose sum is σ = 16184770560. Its totient is φ = 11631876480.
The previous prime is 13780013129. The next prime is 13780013173. The reversal of 13780013143 is 34131008731.
13780013143 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 13780013143 - 225 = 13746458711 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13780013123) 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 31 ways as a sum of consecutive naturals, for example, 536746 + ... + 561832.
It is an arithmetic number, because the mean of its divisors is an integer number (505774080).
Almost surely, 213780013143 is an apocalyptic number.
13780013143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13780013143 is a deficient number, since it is larger than the sum of its proper divisors (2404757417).
13780013143 is a wasteful number, since it uses less digits than its factorization.
13780013143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25207.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 13780013143 in words is "thirteen billion, seven hundred eighty million, thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •