Base | Representation |
---|---|
bin | 11110111011001101000… |
… | …100100000000000000001 |
3 | 21112011101122211201202011 |
4 | 132323031010200000001 |
5 | 234304304003300103 |
6 | 4304141001052521 |
7 | 306352206645106 |
oct | 36731504400001 |
9 | 7464348751664 |
10 | 2125154353153 |
11 | 74a3002587a7 |
12 | 2a3a51a87141 |
13 | 12552a571740 |
14 | 74c02596aad |
15 | 3a430728d6d |
hex | 1eecd120001 |
2125154353153 has 8 divisors (see below), whose sum is σ = 2300245167528. Its totient is φ = 1951723167744.
The previous prime is 2125154353087. The next prime is 2125154353177. The reversal of 2125154353153 is 3513534515212.
It can be written as a sum of positive squares in 4 ways, for example, as 431377044849 + 1693777308304 = 656793^2 + 1301452^2 .
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 2125154353153 - 221 = 2125152256001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2125154353253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 414904576 + ... + 414909697.
It is an arithmetic number, because the mean of its divisors is an integer number (287530645941).
Almost surely, 22125154353153 is an apocalyptic number.
It is an amenable number.
2125154353153 is a deficient number, since it is larger than the sum of its proper divisors (175090814375).
2125154353153 is a wasteful number, since it uses less digits than its factorization.
2125154353153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 829814483.
The product of its digits is 270000, while the sum is 40.
Adding to 2125154353153 its reverse (3513534515212), we get a palindrome (5638688868365).
The spelling of 2125154353153 in words is "two trillion, one hundred twenty-five billion, one hundred fifty-four million, three hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •