Base | Representation |
---|---|
bin | 1100010010001100001100… |
… | …1000011101100101000000 |
3 | 1202211020000201122201021102 |
4 | 3010203003020131211000 |
5 | 3232243110121012143 |
6 | 44420511512513532 |
7 | 2562552254555450 |
oct | 304430310354500 |
9 | 52736021581242 |
10 | 13506650954048 |
11 | 433815838942a |
12 | 162181a0ab8a8 |
13 | 76c8969cb255 |
14 | 349a226a5d60 |
15 | 1865141380b8 |
hex | c48c321d940 |
13506650954048 has 56 divisors (see below), whose sum is σ = 30632172009600. Its totient is φ = 5788372474368.
The previous prime is 13506650954047. The next prime is 13506650954077. The reversal of 13506650954048 is 84045905660531.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 13506650953984 and 13506650954002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13506650954047) 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, 13438358 + ... + 14408426.
It is an arithmetic number, because the mean of its divisors is an integer number (547003071600).
Almost surely, 213506650954048 is an apocalyptic number.
It is an amenable number.
13506650954048 is an abundant number, since it is smaller than the sum of its proper divisors (17125521055552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13506650954048 is an equidigital number, since it uses as much as digits as its factorization.
13506650954048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001167 (or 1001157 counting only the distinct ones).
The product of its (nonzero) digits is 15552000, while the sum is 56.
The spelling of 13506650954048 in words is "thirteen trillion, five hundred six billion, six hundred fifty million, nine hundred fifty-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •