Base | Representation |
---|---|
bin | 11001001000010111… |
… | …10010100010101111 |
3 | 1021211021112012112201 |
4 | 30210023302202233 |
5 | 210112421103041 |
6 | 10110443442331 |
7 | 655225605061 |
oct | 144413624257 |
9 | 37737465481 |
10 | 13491972271 |
11 | 57a3959508 |
12 | 27465263a7 |
13 | 13702a5b5b |
14 | 91dc31731 |
15 | 53e731631 |
hex | 3242f28af |
13491972271 has 8 divisors (see below), whose sum is σ = 13807312640. Its totient is φ = 13176703512.
The previous prime is 13491972229. The next prime is 13491972301. The reversal of 13491972271 is 17227919431.
13491972271 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 a de Polignac number, because none of the positive numbers 2k-13491972271 is a prime.
It is a super-2 number, since 2×134919722712 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13491972071) 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, 653716 + ... + 674038.
It is an arithmetic number, because the mean of its divisors is an integer number (1725914080).
Almost surely, 213491972271 is an apocalyptic number.
13491972271 is a deficient number, since it is larger than the sum of its proper divisors (315340369).
13491972271 is a wasteful number, since it uses less digits than its factorization.
13491972271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35805.
The product of its digits is 190512, while the sum is 46.
The spelling of 13491972271 in words is "thirteen billion, four hundred ninety-one million, nine hundred seventy-two thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •