Base | Representation |
---|---|
bin | 11000011010001111… |
… | …10111000001010000 |
3 | 1020211022111100000012 |
4 | 30031013313001100 |
5 | 203314344103224 |
6 | 10004223014052 |
7 | 642520136456 |
oct | 141507670120 |
9 | 36738440005 |
10 | 13105066064 |
11 | 5615517112 |
12 | 2658a3a328 |
13 | 130b09a37c |
14 | 8c46b89d6 |
15 | 51a7a780e |
hex | 30d1f7050 |
13105066064 has 20 divisors (see below), whose sum is σ = 25393622100. Its totient is φ = 6551873280.
The previous prime is 13105066019. The next prime is 13105066087. The reversal of 13105066064 is 46066050131.
It can be written as a sum of positive squares in 2 ways, for example, as 12452774464 + 652291600 = 111592^2 + 25540^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 13105066064.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 149324 + ... + 220244.
It is an arithmetic number, because the mean of its divisors is an integer number (1269681105).
Almost surely, 213105066064 is an apocalyptic number.
It is an amenable number.
13105066064 is a deficient number, since it is larger than the sum of its proper divisors (12288556036).
13105066064 is a wasteful number, since it uses less digits than its factorization.
13105066064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82478 (or 82472 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 13105066064 in words is "thirteen billion, one hundred five million, sixty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •