Base | Representation |
---|---|
bin | 1100001110000101011111… |
… | …1100011100000110100111 |
3 | 1202120111000012222210012120 |
4 | 3003201113330130012213 |
5 | 3230114200042212211 |
6 | 44324250243521023 |
7 | 2554504622334246 |
oct | 303412774340647 |
9 | 52514005883176 |
10 | 13436133163431 |
11 | 4310260989630 |
12 | 1610019989173 |
13 | 76603920cc24 |
14 | 346452dc695d |
15 | 184788347d06 |
hex | c3857f1c1a7 |
13436133163431 has 32 divisors (see below), whose sum is σ = 19848177169920. Its totient is φ = 8016489062400.
The previous prime is 13436133163399. The next prime is 13436133163451.
13436133163431 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13436133163431 - 25 = 13436133163399 is a prime.
It is a super-2 number, since 2×134361331634312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13436133163451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2683626 + ... + 5837303.
It is an arithmetic number, because the mean of its divisors is an integer number (620255536560).
Almost surely, 213436133163431 is an apocalyptic number.
13436133163431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13436133163431 is a deficient number, since it is larger than the sum of its proper divisors (6412044006489).
13436133163431 is a wasteful number, since it uses less digits than its factorization.
13436133163431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8521687.
The product of its digits is 419904, while the sum is 42.
The spelling of 13436133163431 in words is "thirteen trillion, four hundred thirty-six billion, one hundred thirty-three million, one hundred sixty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •