Base | Representation |
---|---|
bin | 1000111011010000010… |
… | …1010110000001000111 |
3 | 112122210212222000001111 |
4 | 2032310011112001013 |
5 | 10003022324431033 |
6 | 154240142505451 |
7 | 14036015212105 |
oct | 2166405260107 |
9 | 478725860044 |
10 | 153345155143 |
11 | 5a040384784 |
12 | 25876b95287 |
13 | 115ca6118bb |
14 | 75c9b62c75 |
15 | 3ec76017cd |
hex | 23b4156047 |
153345155143 has 4 divisors (see below), whose sum is σ = 153349434720. Its totient is φ = 153340875568.
The previous prime is 153345155023. The next prime is 153345155147. The reversal of 153345155143 is 341551543351.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341551543351 = 31 ⋅11017791721.
It is a cyclic number.
It is not a de Polignac number, because 153345155143 - 213 = 153345146951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153345155096 and 153345155105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153345155147) 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, 2085583 + ... + 2157856.
It is an arithmetic number, because the mean of its divisors is an integer number (38337358680).
Almost surely, 2153345155143 is an apocalyptic number.
153345155143 is a deficient number, since it is larger than the sum of its proper divisors (4279577).
153345155143 is an equidigital number, since it uses as much as digits as its factorization.
153345155143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4279576.
The product of its digits is 270000, while the sum is 40.
Adding to 153345155143 its reverse (341551543351), we get a palindrome (494896698494).
The spelling of 153345155143 in words is "one hundred fifty-three billion, three hundred forty-five million, one hundred fifty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •