Base | Representation |
---|---|
bin | 11001000000010001… |
… | …01100010000000111 |
3 | 1021122112201110100202 |
4 | 30200020230100013 |
5 | 204443024114312 |
6 | 10100020001115 |
7 | 653442360350 |
oct | 144010542007 |
9 | 37575643322 |
10 | 13424051207 |
11 | 57695883a6 |
12 | 272783019b |
13 | 135c1b4688 |
14 | 914bd0d27 |
15 | 5387b69c2 |
hex | 32022c407 |
13424051207 has 16 divisors (see below), whose sum is σ = 16285204800. Its totient is φ = 10802170368.
The previous prime is 13424051167. The next prime is 13424051213. The reversal of 13424051207 is 70215042431.
It is a cyclic number.
It is not a de Polignac number, because 13424051207 - 230 = 12350309383 is a prime.
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 13424051207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13424051297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94832 + ... + 189317.
It is an arithmetic number, because the mean of its divisors is an integer number (1017825300).
Almost surely, 213424051207 is an apocalyptic number.
13424051207 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13424051207 is a deficient number, since it is larger than the sum of its proper divisors (2861153593).
13424051207 is a wasteful number, since it uses less digits than its factorization.
13424051207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284570.
The product of its (nonzero) digits is 6720, while the sum is 29.
Adding to 13424051207 its reverse (70215042431), we get a palindrome (83639093638).
The spelling of 13424051207 in words is "thirteen billion, four hundred twenty-four million, fifty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •