Base | Representation |
---|---|
bin | 11000011011010011… |
… | …11100111100010101 |
3 | 1020211221022101111000 |
4 | 30031221330330111 |
5 | 203324141100341 |
6 | 10005142333513 |
7 | 642656121354 |
oct | 141551747425 |
9 | 36757271430 |
10 | 13114003221 |
11 | 561a5707a0 |
12 | 265ba2a299 |
13 | 130cba9227 |
14 | 8c596399b |
15 | 51b4708b6 |
hex | 30da7cf15 |
13114003221 has 16 divisors (see below), whose sum is σ = 21194349120. Its totient is φ = 7947880560.
The previous prime is 13114003211. The next prime is 13114003229. The reversal of 13114003221 is 12230041131.
It is not a de Polignac number, because 13114003221 - 215 = 13113970453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13114003194 and 13114003203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13114003229) 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 15 ways as a sum of consecutive naturals, for example, 22077150 + ... + 22077743.
It is an arithmetic number, because the mean of its divisors is an integer number (1324646820).
Almost surely, 213114003221 is an apocalyptic number.
13114003221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13114003221 is a deficient number, since it is larger than the sum of its proper divisors (8080345899).
13114003221 is a wasteful number, since it uses less digits than its factorization.
13114003221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44154913 (or 44154907 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13114003221 its reverse (12230041131), we get a palindrome (25344044352).
The spelling of 13114003221 in words is "thirteen billion, one hundred fourteen million, three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •