Base | Representation |
---|---|
bin | 11000110010011100… |
… | …11000001000000101 |
3 | 1021100110112120202021 |
4 | 30121032120020011 |
5 | 204223333214000 |
6 | 10040314443141 |
7 | 650533664434 |
oct | 143116301005 |
9 | 37313476667 |
10 | 13308101125 |
11 | 570a092390 |
12 | 26b4a334b1 |
13 | 1341177c67 |
14 | 90364b11b |
15 | 52d51111a |
hex | 319398205 |
13308101125 has 64 divisors (see below), whose sum is σ = 19359175680. Its totient is φ = 9031176000.
The previous prime is 13308101123. The next prime is 13308101129. The reversal of 13308101125 is 52110180331.
It is not a de Polignac number, because 13308101125 - 21 = 13308101123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 13308101125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13308101123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1746574 + ... + 1754176.
It is an arithmetic number, because the mean of its divisors is an integer number (302487120).
Almost surely, 213308101125 is an apocalyptic number.
It is an amenable number.
13308101125 is a deficient number, since it is larger than the sum of its proper divisors (6051074555).
13308101125 is a wasteful number, since it uses less digits than its factorization.
13308101125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7715 (or 7705 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 13308101125 its reverse (52110180331), we get a palindrome (65418281456).
The spelling of 13308101125 in words is "thirteen billion, three hundred eight million, one hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •