Base | Representation |
---|---|
bin | 10011010010100000000… |
… | …100000100111000111111 |
3 | 11200201102211121122122021 |
4 | 103102200010010320333 |
5 | 133204144022202320 |
6 | 2452535330501011 |
7 | 164524000401040 |
oct | 23224004047077 |
9 | 4621384548567 |
10 | 1325535350335 |
11 | 47117a16a909 |
12 | 194a93134767 |
13 | 97cc75120b1 |
14 | 48228a8a8c7 |
15 | 24730ae4daa |
hex | 134a0104e3f |
1325535350335 has 8 divisors (see below), whose sum is σ = 1817877051936. Its totient is φ = 908938525920.
The previous prime is 1325535350311. The next prime is 1325535350357. The reversal of 1325535350335 is 5330535355231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1325535350335 - 211 = 1325535348287 is a prime.
It is a super-2 number, since 2×13255353503352 (a number of 25 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 = 1325535350291 and 1325535350300.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18936219256 + ... + 18936219325.
It is an arithmetic number, because the mean of its divisors is an integer number (227234631492).
Almost surely, 21325535350335 is an apocalyptic number.
1325535350335 is a deficient number, since it is larger than the sum of its proper divisors (492341701601).
1325535350335 is an equidigital number, since it uses as much as digits as its factorization.
1325535350335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37872438593.
The product of its (nonzero) digits is 1518750, while the sum is 43.
The spelling of 1325535350335 in words is "one trillion, three hundred twenty-five billion, five hundred thirty-five million, three hundred fifty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •