Base | Representation |
---|---|
bin | 11001100000110100… |
… | …10101111100100011 |
3 | 1022100120112110221111 |
4 | 30300122111330203 |
5 | 211022430121031 |
6 | 10143052404151 |
7 | 663266355436 |
oct | 146032257443 |
9 | 38316473844 |
10 | 13697113891 |
11 | 589973343a |
12 | 27a3176657 |
13 | 13a3940526 |
14 | 93d19181d |
15 | 5527541b1 |
hex | 330695f23 |
13697113891 has 8 divisors (see below), whose sum is σ = 13801596480. Its totient is φ = 13593028608.
The previous prime is 13697113867. The next prime is 13697113921. The reversal of 13697113891 is 19831179631.
13697113891 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13697113891 - 227 = 13562896163 is a prime.
It is a super-2 number, since 2×136971138912 (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 (13697113841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29931 + ... + 168196.
It is an arithmetic number, because the mean of its divisors is an integer number (1725199560).
Almost surely, 213697113891 is an apocalyptic number.
13697113891 is a deficient number, since it is larger than the sum of its proper divisors (104482589).
13697113891 is a wasteful number, since it uses less digits than its factorization.
13697113891 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198653.
The product of its digits is 244944, while the sum is 49.
The spelling of 13697113891 in words is "thirteen billion, six hundred ninety-seven million, one hundred thirteen thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •