Base | Representation |
---|---|
bin | 1011110110100100100100… |
… | …0000010110010001100000 |
3 | 1201010212021022221110112011 |
4 | 2331221021000112101200 |
5 | 3202004323313312224 |
6 | 43414520054442304 |
7 | 2513353651622242 |
oct | 275511100262140 |
9 | 51125238843464 |
10 | 13032155604064 |
11 | 41749a70aaa93 |
12 | 1565876663394 |
13 | 736c0880947c |
14 | 330a8c872092 |
15 | 178ee265d394 |
hex | bda49016460 |
13032155604064 has 12 divisors (see below), whose sum is σ = 25657056345564. Its totient is φ = 6516077802016.
The previous prime is 13032155604049. The next prime is 13032155604151. The reversal of 13032155604064 is 46040655123031.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203627431282 + ... + 203627431345.
It is an arithmetic number, because the mean of its divisors is an integer number (2138088028797).
Almost surely, 213032155604064 is an apocalyptic number.
It is an amenable number.
13032155604064 is a deficient number, since it is larger than the sum of its proper divisors (12624900741500).
13032155604064 is an equidigital number, since it uses as much as digits as its factorization.
13032155604064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407254862637 (or 407254862629 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 13032155604064 in words is "thirteen trillion, thirty-two billion, one hundred fifty-five million, six hundred four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •