Base | Representation |
---|---|
bin | 1000111011001010110… |
… | …1000011110111101101 |
3 | 112122202021102012211021 |
4 | 2032302231003313231 |
5 | 10003000413342031 |
6 | 154233554454141 |
7 | 14035314412564 |
oct | 2166255036755 |
9 | 478667365737 |
10 | 153322012141 |
11 | 5a029308031 |
12 | 2586b294351 |
13 | 115c589aa0c |
14 | 75c6a5abdb |
15 | 3ec557e511 |
hex | 23b2b43ded |
153322012141 has 4 divisors (see below), whose sum is σ = 153323473984. Its totient is φ = 153320550300.
The previous prime is 153322012139. The next prime is 153322012163. The reversal of 153322012141 is 141210223351.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141210223351 = 37 ⋅3816492523.
It is a cyclic number.
It is not a de Polignac number, because 153322012141 - 21 = 153322012139 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 (153322012121) 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, 560325 + ... + 787786.
It is an arithmetic number, because the mean of its divisors is an integer number (38330868496).
Almost surely, 2153322012141 is an apocalyptic number.
It is an amenable number.
153322012141 is a deficient number, since it is larger than the sum of its proper divisors (1461843).
153322012141 is a wasteful number, since it uses less digits than its factorization.
153322012141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1461842.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 153322012141 its reverse (141210223351), we get a palindrome (294532235492).
The spelling of 153322012141 in words is "one hundred fifty-three billion, three hundred twenty-two million, twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •