Base | Representation |
---|---|
bin | 11001010011110111… |
… | …01111100010000011 |
3 | 1022002000000201012121 |
4 | 30221323233202003 |
5 | 210312114211211 |
6 | 10124211105111 |
7 | 660506511610 |
oct | 145173574203 |
9 | 38060021177 |
10 | 13588428931 |
11 | 584334a860 |
12 | 27728a2197 |
13 | 13872788bc |
14 | 92c97d507 |
15 | 547e36271 |
hex | 329eef883 |
13588428931 has 8 divisors (see below), whose sum is σ = 16941417984. Its totient is φ = 10588386120.
The previous prime is 13588428929. The next prime is 13588428947. The reversal of 13588428931 is 13982488531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13588428931 - 21 = 13588428929 is a prime.
It is a super-2 number, since 2×135884289312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13588428131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88236475 + ... + 88236628.
It is an arithmetic number, because the mean of its divisors is an integer number (2117677248).
Almost surely, 213588428931 is an apocalyptic number.
13588428931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13588428931 is a deficient number, since it is larger than the sum of its proper divisors (3352989053).
13588428931 is a wasteful number, since it uses less digits than its factorization.
13588428931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176473121.
The product of its digits is 1658880, while the sum is 52.
The spelling of 13588428931 in words is "thirteen billion, five hundred eighty-eight million, four hundred twenty-eight thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •