Base | Representation |
---|---|
bin | 10000000100001101111… |
… | …10100001010010010111 |
3 | 1221202212020200022011222 |
4 | 20002012332201102113 |
5 | 33021014202200403 |
6 | 1101332235520555 |
7 | 54611402361545 |
oct | 10020676412227 |
9 | 1852766608158 |
10 | 552020350103 |
11 | 1a3124107482 |
12 | 8ab9a5b915b |
13 | 4009463b721 |
14 | 1ca09dc8d95 |
15 | e55ca5a338 |
hex | 8086fa1497 |
552020350103 has 8 divisors (see below), whose sum is σ = 581482425600. Its totient is φ = 522599111928.
The previous prime is 552020350099. The next prime is 552020350109. The reversal of 552020350103 is 301053020255.
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 552020350103 - 22 = 552020350099 is a prime.
It is a super-2 number, since 2×5520203501032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552020350109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10181573 + ... + 10235646.
It is an arithmetic number, because the mean of its divisors is an integer number (72685303200).
Almost surely, 2552020350103 is an apocalyptic number.
552020350103 is a deficient number, since it is larger than the sum of its proper divisors (29462075497).
552020350103 is a wasteful number, since it uses less digits than its factorization.
552020350103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20418661.
The product of its (nonzero) digits is 4500, while the sum is 26.
Adding to 552020350103 its reverse (301053020255), we get a palindrome (853073370358).
The spelling of 552020350103 in words is "five hundred fifty-two billion, twenty million, three hundred fifty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •