Base | Representation |
---|---|
bin | 1011111110000101110101… |
… | …0111011010110001111001 |
3 | 1201121012201211212111010110 |
4 | 2333201131113122301321 |
5 | 3211113414112340113 |
6 | 43554123341534533 |
7 | 2525606266656642 |
oct | 277413527326171 |
9 | 51535654774113 |
10 | 13161346215033 |
11 | 4214771906165 |
12 | 1586910274449 |
13 | 746156ac1683 |
14 | 33702664a6c9 |
15 | 17c5543e2bc3 |
hex | bf85d5dac79 |
13161346215033 has 32 divisors (see below), whose sum is σ = 17815669200000. Its totient is φ = 8641922305536.
The previous prime is 13161346214993. The next prime is 13161346215047. The reversal of 13161346215033 is 33051264316131.
It is not a de Polignac number, because 13161346215033 - 220 = 13161345166457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13161346214982 and 13161346215000.
It is not an unprimeable number, because it can be changed into a prime (13161346215533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26139343 + ... + 26638091.
It is an arithmetic number, because the mean of its divisors is an integer number (556739662500).
Almost surely, 213161346215033 is an apocalyptic number.
It is an amenable number.
13161346215033 is a deficient number, since it is larger than the sum of its proper divisors (4654322984967).
13161346215033 is a wasteful number, since it uses less digits than its factorization.
13161346215033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499401.
The product of its (nonzero) digits is 116640, while the sum is 39.
The spelling of 13161346215033 in words is "thirteen trillion, one hundred sixty-one billion, three hundred forty-six million, two hundred fifteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •