Base | Representation |
---|---|
bin | 1100000010011001111001… |
… | …0011010110110111111101 |
3 | 1201212022000021102120101210 |
4 | 3000212132103112313331 |
5 | 3213322200212113113 |
6 | 44052140513355033 |
7 | 2534141535503154 |
oct | 300463623266775 |
9 | 51768007376353 |
10 | 13235450113533 |
11 | 42431395a598a |
12 | 1599151568a79 |
13 | 75013653781b |
14 | 33a85630059b |
15 | 17e43ee4d6c3 |
hex | c099e4d6dfd |
13235450113533 has 8 divisors (see below), whose sum is σ = 18057668372128. Its totient is φ = 8618432631984.
The previous prime is 13235450113477. The next prime is 13235450113537. The reversal of 13235450113533 is 33531105453231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13235450113533 - 234 = 13218270244349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13235450113491 and 13235450113500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13235450113537) 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, 51300194110 + ... + 51300194367.
It is an arithmetic number, because the mean of its divisors is an integer number (2257208546516).
Almost surely, 213235450113533 is an apocalyptic number.
It is an amenable number.
13235450113533 is a deficient number, since it is larger than the sum of its proper divisors (4822218258595).
13235450113533 is a wasteful number, since it uses less digits than its factorization.
13235450113533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102600388523.
The product of its (nonzero) digits is 243000, while the sum is 39.
Adding to 13235450113533 its reverse (33531105453231), we get a palindrome (46766555566764).
The spelling of 13235450113533 in words is "thirteen trillion, two hundred thirty-five billion, four hundred fifty million, one hundred thirteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •