Base | Representation |
---|---|
bin | 101100001010001001010… |
… | …010110111101010011101 |
3 | 101202002201000211012120000 |
4 | 230022021102313222131 |
5 | 344204224341224112 |
6 | 10242015253044513 |
7 | 432144662161104 |
oct | 54121122675235 |
9 | 11662630735500 |
10 | 3034550336157 |
11 | a6aa446106aa |
12 | 410148926739 |
13 | 190206843bb2 |
14 | a6c317d103b |
15 | 53e07aa07dc |
hex | 2c2894b7a9d |
3034550336157 has 10 divisors (see below), whose sum is σ = 4533093712158. Its totient is φ = 2023033557384.
The previous prime is 3034550336137. The next prime is 3034550336171. The reversal of 3034550336157 is 7516330554303.
3034550336157 is a `hidden beast` number, since 3 + 0 + 3 + 4 + 550 + 33 + 61 + 5 + 7 = 666.
3034550336157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 2541923224281 + 492627111876 = 1594341^2 + 701874^2 .
It is not a de Polignac number, because 3034550336157 - 219 = 3034549811869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3034550336137) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 18731792118 + ... + 18731792279.
Almost surely, 23034550336157 is an apocalyptic number.
It is an amenable number.
3034550336157 is a deficient number, since it is larger than the sum of its proper divisors (1498543376001).
3034550336157 is an equidigital number, since it uses as much as digits as its factorization.
3034550336157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37463584409 (or 37463584400 counting only the distinct ones).
The product of its (nonzero) digits is 1701000, while the sum is 45.
The spelling of 3034550336157 in words is "three trillion, thirty-four billion, five hundred fifty million, three hundred thirty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •