Base | Representation |
---|---|
bin | 111110110100010001100101… |
… | …0001101000011001110010001 |
3 | 2200110101112101001121011121112 |
4 | 1331220203022031003032101 |
5 | 1034410323210322131023 |
6 | 5235054241002103105 |
7 | 224245603255455005 |
oct | 17550431215031621 |
9 | 2613345331534545 |
10 | 552542345114513 |
11 | 150069990082446 |
12 | 51b7a4a94aaa95 |
13 | 1a94069a65ac70 |
14 | 9a63299558705 |
15 | 43d2d63989478 |
hex | 1f688ca343391 |
552542345114513 has 16 divisors (see below), whose sum is σ = 631200110083200. Its totient is φ = 479159207444736.
The previous prime is 552542345114503. The next prime is 552542345114561. The reversal of 552542345114513 is 315411543245255.
It is not a de Polignac number, because 552542345114513 - 210 = 552542345113489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (552542345114503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2285246213 + ... + 2285487986.
It is an arithmetic number, because the mean of its divisors is an integer number (39450006880200).
Almost surely, 2552542345114513 is an apocalyptic number.
It is an amenable number.
552542345114513 is a deficient number, since it is larger than the sum of its proper divisors (78657764968687).
552542345114513 is a wasteful number, since it uses less digits than its factorization.
552542345114513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4570734776.
The product of its digits is 7200000, while the sum is 50.
Adding to 552542345114513 its reverse (315411543245255), we get a palindrome (867953888359768).
The spelling of 552542345114513 in words is "five hundred fifty-two trillion, five hundred forty-two billion, three hundred forty-five million, one hundred fourteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •