Base | Representation |
---|---|
bin | 1000111011100010100… |
… | …0101000010100111001 |
3 | 112200000012122102202211 |
4 | 2032320220220110321 |
5 | 10003201401422131 |
6 | 154251511255121 |
7 | 14040633231565 |
oct | 2167050502471 |
9 | 480005572684 |
10 | 153421514041 |
11 | 5a07a499304 |
12 | 2589867a4a1 |
13 | 11610398893 |
14 | 75d5d5c6a5 |
15 | 3ece1865b1 |
hex | 23b8a28539 |
153421514041 has 8 divisors (see below), whose sum is σ = 157116422144. Its totient is φ = 149732377200.
The previous prime is 153421514023. The next prime is 153421514063. The reversal of 153421514041 is 140415124351.
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 153421514041 - 29 = 153421513529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153421513994 and 153421514012.
It is not an unprimeable number, because it can be changed into a prime (153421514011) 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, 1388985 + ... + 1495366.
It is an arithmetic number, because the mean of its divisors is an integer number (19639552768).
Almost surely, 2153421514041 is an apocalyptic number.
It is an amenable number.
153421514041 is a deficient number, since it is larger than the sum of its proper divisors (3694908103).
153421514041 is a wasteful number, since it uses less digits than its factorization.
153421514041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2885631.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 153421514041 its reverse (140415124351), we get a palindrome (293836638392).
The spelling of 153421514041 in words is "one hundred fifty-three billion, four hundred twenty-one million, five hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •