Base | Representation |
---|---|
bin | 11001001001010111… |
… | …11111000011000100 |
3 | 1021211212101222210222 |
4 | 30210223333003010 |
5 | 210122101141400 |
6 | 10111344403512 |
7 | 655360416020 |
oct | 144453770304 |
9 | 37755358728 |
10 | 13500412100 |
11 | 57a86a347a |
12 | 2749316598 |
13 | 1371c6c536 |
14 | 920dcb380 |
15 | 54034c185 |
hex | 324aff0c4 |
13500412100 has 36 divisors (see below), whose sum is σ = 33481023744. Its totient is φ = 4628712480.
The previous prime is 13500412073. The next prime is 13500412109. The reversal of 13500412100 is 121400531.
13500412100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×135004121002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13500412109) 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 11 ways as a sum of consecutive naturals, for example, 9642452 + ... + 9643851.
Almost surely, 213500412100 is an apocalyptic number.
13500412100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13500412100 is an abundant number, since it is smaller than the sum of its proper divisors (19980611644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13500412100 is a wasteful number, since it uses less digits than its factorization.
13500412100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19286324 (or 19286317 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 13500412100 its reverse (121400531), we get a palindrome (13621812631).
The spelling of 13500412100 in words is "thirteen billion, five hundred million, four hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •