Base | Representation |
---|---|
bin | 11000010010000111… |
… | …00111001111101010 |
3 | 1020122120010021221110 |
4 | 30021003213033222 |
5 | 203144413002020 |
6 | 5553344451150 |
7 | 641031226401 |
oct | 141103471752 |
9 | 36576107843 |
10 | 13036844010 |
11 | 558aa5a953 |
12 | 263a019ab6 |
13 | 12c9c01ba8 |
14 | 8b95da638 |
15 | 5147cd8e0 |
hex | 3090e73ea |
13036844010 has 16 divisors (see below), whose sum is σ = 31288425696. Its totient is φ = 3476491728.
The previous prime is 13036843999. The next prime is 13036844057. The reversal of 13036844010 is 1044863031.
13036844010 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 (30), and also a Moran number because the ratio is a prime number: 434561467 = 13036844010 / (1 + 3 + 0 + 3 + 6 + 8 + 4 + 4 + 0 + 1 + 0).
It is a Curzon 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 in 7 ways as a sum of consecutive naturals, for example, 217280704 + ... + 217280763.
It is an arithmetic number, because the mean of its divisors is an integer number (1955526606).
Almost surely, 213036844010 is an apocalyptic number.
13036844010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13036844010 is an abundant number, since it is smaller than the sum of its proper divisors (18251581686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13036844010 is a wasteful number, since it uses less digits than its factorization.
13036844010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434561477.
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 13036844010 in words is "thirteen billion, thirty-six million, eight hundred forty-four thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •