Base | Representation |
---|---|
bin | 11001011101110000… |
… | …10000100111001011 |
3 | 1022021210011011202200 |
4 | 30232320100213023 |
5 | 210444334330211 |
6 | 10140333331243 |
7 | 662534666445 |
oct | 145670204713 |
9 | 38253134680 |
10 | 13671401931 |
11 | 5886171690 |
12 | 2796636b23 |
13 | 139b50a255 |
14 | 9399bb495 |
15 | 550375b56 |
hex | 32ee109cb |
13671401931 has 24 divisors (see below), whose sum is σ = 21560423664. Its totient is φ = 8278925760.
The previous prime is 13671401929. The next prime is 13671401951. The reversal of 13671401931 is 13910417631.
13671401931 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 13671401931 - 21 = 13671401929 is a prime.
It is a super-2 number, since 2×136714019312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13671401951) 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, 66645 + ... + 178281.
It is an arithmetic number, because the mean of its divisors is an integer number (898350986).
Almost surely, 213671401931 is an apocalyptic number.
13671401931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13671401931 is a deficient number, since it is larger than the sum of its proper divisors (7889021733).
13671401931 is a wasteful number, since it uses less digits than its factorization.
13671401931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112891 (or 112888 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The spelling of 13671401931 in words is "thirteen billion, six hundred seventy-one million, four hundred one thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •