Base | Representation |
---|---|
bin | 1001011000010000… |
… | …10110011111110101 |
3 | 110222220220111021100 |
4 | 10230020112133311 |
5 | 40303022312401 |
6 | 2151353040313 |
7 | 235531542441 |
oct | 45410263765 |
9 | 13886814240 |
10 | 5035354101 |
11 | 2154365078 |
12 | b863b6099 |
13 | 62328988b |
14 | 35aa65821 |
15 | 1e70dbb86 |
hex | 12c2167f5 |
5035354101 has 12 divisors (see below), whose sum is σ = 7275431020. Its totient is φ = 3355914240.
The previous prime is 5035354021. The next prime is 5035354123. The reversal of 5035354101 is 1014535305.
5035354101 is a `hidden beast` number, since 503 + 5 + 3 + 54 + 101 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 780923025 + 4254431076 = 27945^2 + 65226^2 .
It is not a de Polignac number, because 5035354101 - 211 = 5035352053 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 (5035354001) 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 11 ways as a sum of consecutive naturals, for example, 49420 + ... + 111861.
Almost surely, 25035354101 is an apocalyptic number.
It is an amenable number.
5035354101 is a deficient number, since it is larger than the sum of its proper divisors (2240076919).
5035354101 is a wasteful number, since it uses less digits than its factorization.
5035354101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164756 (or 164753 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 5035354101 is about 70960.2290089315. The cubic root of 5035354101 is about 1713.9967954375.
Adding to 5035354101 its reverse (1014535305), we get a palindrome (6049889406).
The spelling of 5035354101 in words is "five billion, thirty-five million, three hundred fifty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •