Base | Representation |
---|---|
bin | 10001011110110011010… |
… | …101000111110001101101 |
3 | 11020211202222102022101011 |
4 | 101132303111013301231 |
5 | 124140232430043000 |
6 | 2315512141145221 |
7 | 152535306026353 |
oct | 21366325076155 |
9 | 4224688368334 |
10 | 1201304534125 |
11 | 42351a100973 |
12 | 1749a255b211 |
13 | 8938994c6a7 |
14 | 422018a97d3 |
15 | 213ae4c42ba |
hex | 117b3547c6d |
1201304534125 has 16 divisors (see below), whose sum is σ = 1507511114928. Its totient is φ = 955733976000.
The previous prime is 1201304534117. The next prime is 1201304534147. The reversal of 1201304534125 is 5214354031021.
It can be written as a sum of positive squares in 8 ways, for example, as 898783633764 + 302520900361 = 948042^2 + 550019^2 .
It is not a de Polignac number, because 1201304534125 - 23 = 1201304534117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26525542 + ... + 26570791.
It is an arithmetic number, because the mean of its divisors is an integer number (94219444683).
Almost surely, 21201304534125 is an apocalyptic number.
It is an amenable number.
1201304534125 is a deficient number, since it is larger than the sum of its proper divisors (306206580803).
1201304534125 is an equidigital number, since it uses as much as digits as its factorization.
1201304534125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53096529 (or 53096519 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1201304534125 its reverse (5214354031021), we get a palindrome (6415658565146).
The spelling of 1201304534125 in words is "one trillion, two hundred one billion, three hundred four million, five hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •