Base | Representation |
---|---|
bin | 10111010100010101110111… |
… | …001001101000001100000001 |
3 | 111110002222001020102011200101 |
4 | 113110111313021220030001 |
5 | 101420211401340423301 |
6 | 1002040100031522401 |
7 | 30413130166604656 |
oct | 2724256711501401 |
9 | 443088036364611 |
10 | 102552933139201 |
11 | 2a749500231396 |
12 | b603541989401 |
13 | 452b91416c60c |
14 | 1b478349b5c2d |
15 | bcc98550d701 |
hex | 5d4577268301 |
102552933139201 has 4 divisors (see below), whose sum is σ = 103957767839812. Its totient is φ = 101148098438592.
The previous prime is 102552933139171. The next prime is 102552933139211. The reversal of 102552933139201 is 102931339255201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79813854499600 + 22739078639601 = 8933860^2 + 4768551^2 .
It is a cyclic number.
It is not a de Polignac number, because 102552933139201 - 25 = 102552933139169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102552933139211) 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, 702417350196 + ... + 702417350341.
It is an arithmetic number, because the mean of its divisors is an integer number (25989441959953).
Almost surely, 2102552933139201 is an apocalyptic number.
It is an amenable number.
102552933139201 is a deficient number, since it is larger than the sum of its proper divisors (1404834700611).
102552933139201 is an equidigital number, since it uses as much as digits as its factorization.
102552933139201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404834700610.
The product of its (nonzero) digits is 437400, while the sum is 46.
The spelling of 102552933139201 in words is "one hundred two trillion, five hundred fifty-two billion, nine hundred thirty-three million, one hundred thirty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •