Base | Representation |
---|---|
bin | 10110100101011100100… |
… | …000110111001110011101 |
3 | 12111101002000020220021101 |
4 | 112211130200313032131 |
5 | 200412032020000131 |
6 | 3144554543033101 |
7 | 220062611326060 |
oct | 26453440671635 |
9 | 5441060226241 |
10 | 1552035312541 |
11 | 54923a52191a |
12 | 21096559b791 |
13 | b3482a4577c |
14 | 551944088d7 |
15 | 2a58a779c61 |
hex | 1695c83739d |
1552035312541 has 8 divisors (see below), whose sum is σ = 1773794873664. Its totient is φ = 1330285809120.
The previous prime is 1552035312521. The next prime is 1552035312557. The reversal of 1552035312541 is 1452135302551.
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 1552035312541 - 29 = 1552035312029 is a prime.
It is a super-2 number, since 2×15520353125412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1552035312541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1552035312521) 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, 2180800 + ... + 2803561.
It is an arithmetic number, because the mean of its divisors is an integer number (221724359208).
Almost surely, 21552035312541 is an apocalyptic number.
It is an amenable number.
1552035312541 is a deficient number, since it is larger than the sum of its proper divisors (221759561123).
1552035312541 is an equidigital number, since it uses as much as digits as its factorization.
1552035312541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5028851.
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 1552035312541 in words is "one trillion, five hundred fifty-two billion, thirty-five million, three hundred twelve thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •