Base | Representation |
---|---|
bin | 1000111000100001010… |
… | …1001110100010101011 |
3 | 112120220201202012221201 |
4 | 2032020111032202223 |
5 | 10000021421340243 |
6 | 154035241545031 |
7 | 14011563061603 |
oct | 2161025164253 |
9 | 476821665851 |
10 | 152611121323 |
11 | 597a3aaa261 |
12 | 256b11a5177 |
13 | 1151151746b |
14 | 755a489c03 |
15 | 3e82e5a04d |
hex | 238854e8ab |
152611121323 has 8 divisors (see below), whose sum is σ = 154954810080. Its totient is φ = 150272828160.
The previous prime is 152611121303. The next prime is 152611121353. The reversal of 152611121323 is 323121116251.
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 152611121323 - 217 = 152610990251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152611121291 and 152611121300.
It is not an unprimeable number, because it can be changed into a prime (152611121303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1291878 + ... + 1405051.
It is an arithmetic number, because the mean of its divisors is an integer number (19369351260).
Almost surely, 2152611121323 is an apocalyptic number.
152611121323 is a deficient number, since it is larger than the sum of its proper divisors (2343688757).
152611121323 is an equidigital number, since it uses as much as digits as its factorization.
152611121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2697797.
The product of its digits is 2160, while the sum is 28.
Adding to 152611121323 its reverse (323121116251), we get a palindrome (475732237574).
The spelling of 152611121323 in words is "one hundred fifty-two billion, six hundred eleven million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •