Base | Representation |
---|---|
bin | 11000100000100011… |
… | …11001010010111100 |
3 | 1020222000011002210000 |
4 | 30100101321102330 |
5 | 203421423402401 |
6 | 10013354114300 |
7 | 644032253025 |
oct | 142021712274 |
9 | 36860132700 |
10 | 13158028476 |
11 | 56424005aa |
12 | 267271b990 |
13 | 1319051c88 |
14 | 8cb743c4c |
15 | 52026a186 |
hex | 3104794bc |
13158028476 has 120 divisors (see below), whose sum is σ = 34731607680. Its totient is φ = 4343683968.
The previous prime is 13158028469. The next prime is 13158028483. The reversal of 13158028476 is 67482085131.
13158028476 is a `hidden beast` number, since 1 + 3 + 1 + 580 + 28 + 47 + 6 = 666.
It is an interprime number because it is at equal distance from previous prime (13158028469) and next prime (13158028483).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 19435450 + ... + 19436126.
It is an arithmetic number, because the mean of its divisors is an integer number (289430064).
Almost surely, 213158028476 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13158028476, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17365803840).
13158028476 is an abundant number, since it is smaller than the sum of its proper divisors (21573579204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13158028476 is a wasteful number, since it uses less digits than its factorization.
13158028476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185 (or 1174 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 45.
The spelling of 13158028476 in words is "thirteen billion, one hundred fifty-eight million, twenty-eight thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •