Base | Representation |
---|---|
bin | 1011111000010111101001… |
… | …1111001111001011100101 |
3 | 1201020211000110020122100012 |
4 | 2332011322133033023211 |
5 | 3203011111420244013 |
6 | 43441025500500005 |
7 | 2515526366443634 |
oct | 276057237171345 |
9 | 51224013218305 |
10 | 13063050556133 |
11 | 4187010538826 |
12 | 156b85924a605 |
13 | 739ac041b3b6 |
14 | 33237dac151b |
15 | 179beeb181a8 |
hex | be17a7cf2e5 |
13063050556133 has 8 divisors (see below), whose sum is σ = 13513895366400. Its totient is φ = 12612232065328.
The previous prime is 13063050556109. The next prime is 13063050556151. The reversal of 13063050556133 is 33165505036031.
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-13063050556133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13063050526133) 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, 5567441 + ... + 7557942.
It is an arithmetic number, because the mean of its divisors is an integer number (1689236920800).
Almost surely, 213063050556133 is an apocalyptic number.
It is an amenable number.
13063050556133 is a deficient number, since it is larger than the sum of its proper divisors (450844810267).
13063050556133 is a wasteful number, since it uses less digits than its factorization.
13063050556133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13159731.
The product of its (nonzero) digits is 364500, while the sum is 41.
The spelling of 13063050556133 in words is "thirteen trillion, sixty-three billion, fifty million, five hundred fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •