Base | Representation |
---|---|
bin | 11001000101111001… |
… | …10011000101000001 |
3 | 1021202211120011122001 |
4 | 30202330303011001 |
5 | 210042120440324 |
6 | 10104423544001 |
7 | 654554602222 |
oct | 144274630501 |
9 | 37684504561 |
10 | 13471265089 |
11 | 57931a5937 |
12 | 273b5bb001 |
13 | 1368c05899 |
14 | 91b1a1249 |
15 | 53c9e0e44 |
hex | 322f33141 |
13471265089 has 8 divisors (see below), whose sum is σ = 13737304512. Its totient is φ = 13205665200.
The previous prime is 13471265057. The next prime is 13471265131. The reversal of 13471265089 is 98056217431.
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 13471265089 - 25 = 13471265057 is a prime.
It is a super-2 number, since 2×134712650892 (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 (13471265039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47637 + ... + 170914.
It is an arithmetic number, because the mean of its divisors is an integer number (1717163064).
It is a 2-persistent number, because it is pandigital, and so is 2⋅13471265089 = 26942530178, but 3⋅13471265089 = 40413795267 is not.
Almost surely, 213471265089 is an apocalyptic number.
It is an amenable number.
13471265089 is a deficient number, since it is larger than the sum of its proper divisors (266039423).
13471265089 is a wasteful number, since it uses less digits than its factorization.
13471265089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219767.
The product of its (nonzero) digits is 362880, while the sum is 46.
It can be divided in two parts, 1347 and 1265089, that added together give a triangular number (1266436 = T1591).
The spelling of 13471265089 in words is "thirteen billion, four hundred seventy-one million, two hundred sixty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •