Base | Representation |
---|---|
bin | 100010101100000110011010… |
… | …110110010110011110110111 |
3 | 202000011222200121210221011201 |
4 | 202230012122312112132313 |
5 | 124444102320100312333 |
6 | 1300250554435513331 |
7 | 44064252252642445 |
oct | 4254063266263667 |
9 | 660158617727151 |
10 | 152564131260343 |
11 | 446800a2837650 |
12 | 1513bb4aa58847 |
13 | 6718974866c7a |
14 | 2996201503b95 |
15 | 12988232e517d |
hex | 8ac19ad967b7 |
152564131260343 has 8 divisors (see below), whose sum is σ = 166436994306960. Its totient is φ = 138691834308480.
The previous prime is 152564131260311. The next prime is 152564131260347. The reversal of 152564131260343 is 343062131465251.
It is a happy number.
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 152564131260343 - 25 = 152564131260311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152564131260293 and 152564131260302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152564131260347) 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, 140960080 + ... + 142038277.
It is an arithmetic number, because the mean of its divisors is an integer number (20804624288370).
Almost surely, 2152564131260343 is an apocalyptic number.
152564131260343 is a deficient number, since it is larger than the sum of its proper divisors (13872863046617).
152564131260343 is a wasteful number, since it uses less digits than its factorization.
152564131260343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283047377.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 152564131260343 in words is "one hundred fifty-two trillion, five hundred sixty-four billion, one hundred thirty-one million, two hundred sixty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •