Base | Representation |
---|---|
bin | 1011110111011000101000… |
… | …0110111001111100110001 |
3 | 1201012012100102101201222002 |
4 | 2331312022012321330301 |
5 | 3202221434440301420 |
6 | 43425151033223345 |
7 | 2514360221430305 |
oct | 275661206717461 |
9 | 51165312351862 |
10 | 13046132743985 |
11 | 417a9199050a0 |
12 | 1568517561b55 |
13 | 738325473173 |
14 | 331616cb7d05 |
15 | 17955e778075 |
hex | bdd8a1b9f31 |
13046132743985 has 8 divisors (see below), whose sum is σ = 17078573774016. Its totient is φ = 9488096541040.
The previous prime is 13046132743901. The next prime is 13046132744081. The reversal of 13046132743985 is 58934723164031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13046132743985 - 28 = 13046132743729 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13046132743985.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118601206709 + ... + 118601206818.
It is an arithmetic number, because the mean of its divisors is an integer number (2134821721752).
It is a 1-persistent number, because it is pandigital, but 2⋅13046132743985 = 26092265487970 is not.
Almost surely, 213046132743985 is an apocalyptic number.
It is an amenable number.
13046132743985 is a deficient number, since it is larger than the sum of its proper divisors (4032441030031).
13046132743985 is a wasteful number, since it uses less digits than its factorization.
13046132743985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237202413543.
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 13046132743985 in words is "thirteen trillion, forty-six billion, one hundred thirty-two million, seven hundred forty-three thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •