Base | Representation |
---|---|
bin | 10000000011101110101111… |
… | …00101010010010001001101 |
3 | 11122000211211211122010221001 |
4 | 20001313113211102101031 |
5 | 14112030042003003023 |
6 | 203034205221140301 |
7 | 10303150510063564 |
oct | 1001672745222115 |
9 | 148024754563831 |
10 | 35312543016013 |
11 | 10284a68a3344a |
12 | 3b6398325a691 |
13 | 1691c5cb30283 |
14 | 8a11c9a44bdb |
15 | 413860e3d6ad |
hex | 201dd795244d |
35312543016013 has 4 divisors (see below), whose sum is σ = 35314421061888. Its totient is φ = 35310664970140.
The previous prime is 35312543016011. The next prime is 35312543016061. The reversal of 35312543016013 is 31061034521353.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 35312543016013 - 21 = 35312543016011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (35312543016011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 938994733 + ... + 939032338.
It is an arithmetic number, because the mean of its divisors is an integer number (8828605265472).
Almost surely, 235312543016013 is an apocalyptic number.
It is an amenable number.
35312543016013 is a deficient number, since it is larger than the sum of its proper divisors (1878045875).
35312543016013 is a wasteful number, since it uses less digits than its factorization.
35312543016013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1878045874.
The product of its (nonzero) digits is 97200, while the sum is 37.
Adding to 35312543016013 its reverse (31061034521353), we get a palindrome (66373577537366).
The spelling of 35312543016013 in words is "thirty-five trillion, three hundred twelve billion, five hundred forty-three million, sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •