Base | Representation |
---|---|
bin | 10010010010010… |
… | …11011111111101 |
3 | 101200122121002011 |
4 | 21021023133331 |
5 | 303232320331 |
6 | 23115531221 |
7 | 3541614142 |
oct | 1111133775 |
9 | 350577064 |
10 | 153401341 |
11 | 79655775 |
12 | 43459b11 |
13 | 25a20132 |
14 | 165323c9 |
15 | d7023b1 |
hex | 924b7fd |
153401341 has 4 divisors (see below), whose sum is σ = 153437500. Its totient is φ = 153365184.
The previous prime is 153401327. The next prime is 153401351. The reversal of 153401341 is 143104351.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 134444025 + 18957316 = 11595^2 + 4354^2 .
It is a cyclic number.
It is not a de Polignac number, because 153401341 - 29 = 153400829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153401321) 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 3 ways as a sum of consecutive naturals, for example, 10716 + ... + 20533.
It is an arithmetic number, because the mean of its divisors is an integer number (38359375).
Almost surely, 2153401341 is an apocalyptic number.
It is an amenable number.
153401341 is a deficient number, since it is larger than the sum of its proper divisors (36159).
153401341 is an equidigital number, since it uses as much as digits as its factorization.
153401341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36158.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 153401341 is about 12385.5295001869. The cubic root of 153401341 is about 535.3153769832.
Adding to 153401341 its reverse (143104351), we get a palindrome (296505692).
The spelling of 153401341 in words is "one hundred fifty-three million, four hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •