Base | Representation |
---|---|
bin | 11000011001111101… |
… | …11001011000100010 |
3 | 1020211011001221221110 |
4 | 30030332321120202 |
5 | 203313243411300 |
6 | 10004100404150 |
7 | 642461152335 |
oct | 141476713042 |
9 | 36734057843 |
10 | 13102716450 |
11 | 561416188a |
12 | 26580a6656 |
13 | 130a756a75 |
14 | 8c426661c |
15 | 51a491550 |
hex | 30cfb9622 |
13102716450 has 48 divisors (see below), whose sum is σ = 33287306976. Its totient is φ = 3408835200.
The previous prime is 13102716449. The next prime is 13102716457. The reversal of 13102716450 is 5461720131.
13102716450 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).
It is not an unprimeable number, because it can be changed into a prime (13102716457) 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 23 ways as a sum of consecutive naturals, for example, 1059112 + ... + 1071411.
It is an arithmetic number, because the mean of its divisors is an integer number (693485562).
Almost surely, 213102716450 is an apocalyptic number.
13102716450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13102716450 is an abundant number, since it is smaller than the sum of its proper divisors (20184590526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102716450 is a wasteful number, since it uses less digits than its factorization.
13102716450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130579 (or 2130574 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The spelling of 13102716450 in words is "thirteen billion, one hundred two million, seven hundred sixteen thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •