Base | Representation |
---|---|
bin | 1000111011001011110… |
… | …1111011011101011101 |
3 | 112122202120201212200001 |
4 | 2032302331323131131 |
5 | 10003003031343031 |
6 | 154234233334301 |
7 | 14035400120656 |
oct | 2166275733535 |
9 | 478676655601 |
10 | 153326434141 |
11 | 5a030858381 |
12 | 25870867391 |
13 | 115c678869a |
14 | 75c748c52d |
15 | 3ec5b54861 |
hex | 23b2f7b75d |
153326434141 has 4 divisors (see below), whose sum is σ = 153879959452. Its totient is φ = 152772908832.
The previous prime is 153326434109. The next prime is 153326434211. The reversal of 153326434141 is 141434623351.
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 15552584100 + 137773850041 = 124710^2 + 371179^2 .
It is a cyclic number.
It is not a de Polignac number, because 153326434141 - 25 = 153326434109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 153326434141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153326434241) 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, 276762240 + ... + 276762793.
It is an arithmetic number, because the mean of its divisors is an integer number (38469989863).
Almost surely, 2153326434141 is an apocalyptic number.
It is an amenable number.
153326434141 is a deficient number, since it is larger than the sum of its proper divisors (553525311).
153326434141 is an equidigital number, since it uses as much as digits as its factorization.
153326434141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553525310.
The product of its digits is 103680, while the sum is 37.
The spelling of 153326434141 in words is "one hundred fifty-three billion, three hundred twenty-six million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •