Base | Representation |
---|---|
bin | 1000111001010110011… |
… | …1110111010010100111 |
3 | 112121111021100020202222 |
4 | 2032111213313102213 |
5 | 10001001013020011 |
6 | 154113325222555 |
7 | 14020241335316 |
oct | 2162547672247 |
9 | 477437306688 |
10 | 152834110631 |
11 | 598a8964444 |
12 | 25753a01a5b |
13 | 115487906b7 |
14 | 757bd3427d |
15 | 3e97805ddb |
hex | 23959f74a7 |
152834110631 has 8 divisors (see below), whose sum is σ = 157774345344. Its totient is φ = 147894507360.
The previous prime is 152834110619. The next prime is 152834110657. The reversal of 152834110631 is 136011438251.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152834110631 - 218 = 152833848487 is a prime.
It is a super-2 number, since 2×1528341106312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152834110591 and 152834110600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152834110031) 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, 361181 + ... + 660393.
It is an arithmetic number, because the mean of its divisors is an integer number (19721793168).
Almost surely, 2152834110631 is an apocalyptic number.
152834110631 is a deficient number, since it is larger than the sum of its proper divisors (4940234713).
152834110631 is a wasteful number, since it uses less digits than its factorization.
152834110631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315721.
The product of its (nonzero) digits is 17280, while the sum is 35.
Adding to 152834110631 its reverse (136011438251), we get a palindrome (288845548882).
The spelling of 152834110631 in words is "one hundred fifty-two billion, eight hundred thirty-four million, one hundred ten thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •