Base | Representation |
---|---|
bin | 100010101101000100111111… |
… | …010010100000010101100110 |
3 | 202000102102002202010220002210 |
4 | 202231010333102200111212 |
5 | 130001202413020113411 |
6 | 1300341505152144250 |
7 | 44102151156012153 |
oct | 4255047722402546 |
9 | 660372082126083 |
10 | 152631314613606 |
11 | 446a66390112a4 |
12 | 15150b7a538086 |
13 | 67220c05a633a |
14 | 299957600122a |
15 | 129a4564cdca6 |
hex | 8ad13f4a0566 |
152631314613606 has 8 divisors (see below), whose sum is σ = 305262629227224. Its totient is φ = 50877104871200.
The previous prime is 152631314613601. The next prime is 152631314613607. The reversal of 152631314613606 is 606316413136251.
It is a sphenic number, since it is the product of 3 distinct primes.
152631314613606 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152631314613601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12719276217795 + ... + 12719276217806.
It is an arithmetic number, because the mean of its divisors is an integer number (38157828653403).
Almost surely, 2152631314613606 is an apocalyptic number.
152631314613606 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152631314613606 is a wasteful number, since it uses less digits than its factorization.
152631314613606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25438552435606.
The product of its (nonzero) digits is 1399680, while the sum is 48.
Adding to 152631314613606 its reverse (606316413136251), we get a palindrome (758947727749857).
The spelling of 152631314613606 in words is "one hundred fifty-two trillion, six hundred thirty-one billion, three hundred fourteen million, six hundred thirteen thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •