Base | Representation |
---|---|
bin | 11001010110001100… |
… | …01000010000010011 |
3 | 1022010100201102001212 |
4 | 30223012020100103 |
5 | 210332112210401 |
6 | 10130145050335 |
7 | 661134325646 |
oct | 145306102023 |
9 | 38110642055 |
10 | 13607928851 |
11 | 58533593a0 |
12 | 27793269ab |
13 | 138b31550a |
14 | 9313b7a5d |
15 | 5499d8dbb |
hex | 32b188413 |
13607928851 has 24 divisors (see below), whose sum is σ = 15787560960. Its totient is φ = 11629904000.
The previous prime is 13607928791. The next prime is 13607928923. The reversal of 13607928851 is 15882970631.
It is not a de Polignac number, because 13607928851 - 226 = 13540819987 is a prime.
It is a super-2 number, since 2×136079288512 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13607928851.
It is not an unprimeable number, because it can be changed into a prime (13603928851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3657170 + ... + 3660888.
It is an arithmetic number, because the mean of its divisors is an integer number (657815040).
Almost surely, 213607928851 is an apocalyptic number.
13607928851 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13607928851 is a deficient number, since it is larger than the sum of its proper divisors (2179632109).
13607928851 is a wasteful number, since it uses less digits than its factorization.
13607928851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4915 (or 4898 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 50.
The spelling of 13607928851 in words is "thirteen billion, six hundred seven million, nine hundred twenty-eight thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •