Base | Representation |
---|---|
bin | 11001001010101001000001… |
… | …10001000110111000011001 |
3 | 21020221120022121120121221110 |
4 | 30211110200301012320121 |
5 | 24223202241024244423 |
6 | 313411221533530533 |
7 | 14441161416011556 |
oct | 1445244061067031 |
9 | 236846277517843 |
10 | 55341203353113 |
11 | 166a7088606997 |
12 | 62595b5043a49 |
13 | 24b5864a94b52 |
14 | d94758423a2d |
15 | 65e841ec6193 |
hex | 325520c46e19 |
55341203353113 has 8 divisors (see below), whose sum is σ = 73788770376288. Its totient is φ = 36893885949344.
The previous prime is 55341203353069. The next prime is 55341203353123. The reversal of 55341203353113 is 31135330214355.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55341203353113 - 210 = 55341203352089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (55341203353123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61886931 + ... + 62774792.
It is an arithmetic number, because the mean of its divisors is an integer number (9223596297036).
Almost surely, 255341203353113 is an apocalyptic number.
It is an amenable number.
55341203353113 is a deficient number, since it is larger than the sum of its proper divisors (18447567023175).
55341203353113 is a wasteful number, since it uses less digits than its factorization.
55341203353113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124809703.
The product of its (nonzero) digits is 243000, while the sum is 39.
Adding to 55341203353113 its reverse (31135330214355), we get a palindrome (86476533567468).
The spelling of 55341203353113 in words is "fifty-five trillion, three hundred forty-one billion, two hundred three million, three hundred fifty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •