Base | Representation |
---|---|
bin | 11000100110000011… |
… | …10011000101111011 |
3 | 1021002012220211110110 |
4 | 30103001303011323 |
5 | 204020224443121 |
6 | 10022122315403 |
7 | 645132225120 |
oct | 142301630573 |
9 | 37065824413 |
10 | 13204140411 |
11 | 5666436140 |
12 | 2686058b63 |
13 | 1325778747 |
14 | 8d3908747 |
15 | 524327d76 |
hex | 31307317b |
13204140411 has 32 divisors (see below), whose sum is σ = 21956848128. Its totient is φ = 6857072640.
The previous prime is 13204140401. The next prime is 13204140437. The reversal of 13204140411 is 11404140231.
13204140411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13204140411 - 27 = 13204140283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (13204140401) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 897531 + ... + 912123.
It is an arithmetic number, because the mean of its divisors is an integer number (686151504).
Almost surely, 213204140411 is an apocalyptic number.
13204140411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13204140411 is a deficient number, since it is larger than the sum of its proper divisors (8752707717).
13204140411 is a wasteful number, since it uses less digits than its factorization.
13204140411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18531.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 13204140411 its reverse (11404140231), we get a palindrome (24608280642).
The spelling of 13204140411 in words is "thirteen billion, two hundred four million, one hundred forty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •