Base | Representation |
---|---|
bin | 10111110000111110111001… |
… | …000000010011000111100001 |
3 | 111201002010022110201011012020 |
4 | 113300332321000103013201 |
5 | 102144433240022331200 |
6 | 1010144202353452053 |
7 | 31005255053515164 |
oct | 2760767100230741 |
9 | 451063273634166 |
10 | 104521133011425 |
11 | 303381887a7539 |
12 | b880a8bb71029 |
13 | 46423ba405620 |
14 | 1bb4bc7d0dadb |
15 | c13c7b830ea0 |
hex | 5f0fb90131e1 |
104521133011425 has 48 divisors (see below), whose sum is σ = 186111000633600. Its totient is φ = 51453852733440.
The previous prime is 104521133011409. The next prime is 104521133011447. The reversal of 104521133011425 is 524110331125401.
It is not a de Polignac number, because 104521133011425 - 24 = 104521133011409 is a prime.
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 47 ways as a sum of consecutive naturals, for example, 15801601 + ... + 21418049.
It is an arithmetic number, because the mean of its divisors is an integer number (3877312513200).
Almost surely, 2104521133011425 is an apocalyptic number.
104521133011425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104521133011425 is a deficient number, since it is larger than the sum of its proper divisors (81589867622175).
104521133011425 is a wasteful number, since it uses less digits than its factorization.
104521133011425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5635562 (or 5635557 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 104521133011425 its reverse (524110331125401), we get a palindrome (628631464136826).
The spelling of 104521133011425 in words is "one hundred four trillion, five hundred twenty-one billion, one hundred thirty-three million, eleven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •