Base | Representation |
---|---|
bin | 1011111101100110100101… |
… | …1001110100011000000000 |
3 | 1201120102002021102000021021 |
4 | 2333121221121310120000 |
5 | 3210444224302024120 |
6 | 43550215142235224 |
7 | 2525161365223021 |
oct | 277315131643000 |
9 | 51512067360237 |
10 | 13152958236160 |
11 | 4211158033516 |
12 | 158516b125b14 |
13 | 74541b088772 |
14 | 33686c62ac48 |
15 | 17c212d0aaaa |
hex | bf669674600 |
13152958236160 has 80 divisors (see below), whose sum is σ = 32553571830912. Its totient is φ = 5091467673600.
The previous prime is 13152958236079. The next prime is 13152958236167. The reversal of 13152958236160 is 6163285925131.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 13152958236098 and 13152958236107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13152958236167) 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, 82789581 + ... + 82948300.
Almost surely, 213152958236160 is an apocalyptic number.
13152958236160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13152958236160 is an abundant number, since it is smaller than the sum of its proper divisors (19400613594752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13152958236160 is an equidigital number, since it uses as much as digits as its factorization.
13152958236160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165737935 (or 165737919 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 52.
The spelling of 13152958236160 in words is "thirteen trillion, one hundred fifty-two billion, nine hundred fifty-eight million, two hundred thirty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •