Base | Representation |
---|---|
bin | 11001110111001011… |
… | …11010011010011101 |
3 | 1022211122111122112012 |
4 | 30323211322122131 |
5 | 211413440234341 |
6 | 10213433121005 |
7 | 1001034653624 |
oct | 147345723235 |
9 | 38748448465 |
10 | 13884696221 |
11 | 5985604860 |
12 | 2835b59165 |
13 | 140376a6a6 |
14 | 95a0606bb |
15 | 563e590eb |
hex | 33b97a69d |
13884696221 has 4 divisors (see below), whose sum is σ = 15146941344. Its totient is φ = 12622451100.
The previous prime is 13884696193. The next prime is 13884696227. The reversal of 13884696221 is 12269648831.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13884696221 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 13884696221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13884696227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 631122545 + ... + 631122566.
It is an arithmetic number, because the mean of its divisors is an integer number (3786735336).
Almost surely, 213884696221 is an apocalyptic number.
13884696221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13884696221 is a deficient number, since it is larger than the sum of its proper divisors (1262245123).
13884696221 is a wasteful number, since it uses less digits than its factorization.
13884696221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1262245122.
The product of its digits is 995328, while the sum is 50.
The spelling of 13884696221 in words is "thirteen billion, eight hundred eighty-four million, six hundred ninety-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •