Base | Representation |
---|---|
bin | 110000101011000110… |
… | …0110011101101101111 |
3 | 100222210120000011011011 |
4 | 1201112030303231233 |
5 | 3203032001210411 |
6 | 120003542210051 |
7 | 10360144232041 |
oct | 1412614635557 |
9 | 328716004134 |
10 | 104525413231 |
11 | 40368964038 |
12 | 18311423927 |
13 | 9b1a243555 |
14 | 50b80a3a91 |
15 | 2abb697c21 |
hex | 1856333b6f |
104525413231 has 8 divisors (see below), whose sum is σ = 104768280000. Its totient is φ = 104282755200.
The previous prime is 104525413229. The next prime is 104525413271. The reversal of 104525413231 is 132314525401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104525413231 - 21 = 104525413229 is a prime.
It is a super-2 number, since 2×1045254132312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104525413193 and 104525413202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104525413271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 973770 + ... + 1075768.
It is an arithmetic number, because the mean of its divisors is an integer number (13096035000).
Almost surely, 2104525413231 is an apocalyptic number.
104525413231 is a deficient number, since it is larger than the sum of its proper divisors (242866769).
104525413231 is a wasteful number, since it uses less digits than its factorization.
104525413231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104369.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 104525413231 its reverse (132314525401), we get a palindrome (236839938632).
The spelling of 104525413231 in words is "one hundred four billion, five hundred twenty-five million, four hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •