Base | Representation |
---|---|
bin | 11000010010111001… |
… | …11010011100011010 |
3 | 1020200000121020122222 |
4 | 30021130322130122 |
5 | 203203112220000 |
6 | 5554142544042 |
7 | 641141501360 |
oct | 141134723432 |
9 | 36600536588 |
10 | 13043476250 |
11 | 559377a842 |
12 | 2640298022 |
13 | 12cb3b48ac |
14 | 8ba445630 |
15 | 51518da85 |
hex | 30973a71a |
13043476250 has 160 divisors (see below), whose sum is σ = 29876436480. Its totient is φ = 4169880000.
The previous prime is 13043476217. The next prime is 13043476273. The reversal of 13043476250 is 5267434031.
13043476250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 13043476250.
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 in 79 ways as a sum of consecutive naturals, for example, 11138165 + ... + 11139335.
It is an arithmetic number, because the mean of its divisors is an integer number (186727728).
Almost surely, 213043476250 is an apocalyptic number.
13043476250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13043476250 is an abundant number, since it is smaller than the sum of its proper divisors (16832960230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13043476250 is a wasteful number, since it uses less digits than its factorization.
13043476250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286 (or 1271 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 35.
The spelling of 13043476250 in words is "thirteen billion, forty-three million, four hundred seventy-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •