Base | Representation |
---|---|
bin | 1000111011011010000… |
… | …0101111101000000001 |
3 | 112122220201121200000001 |
4 | 2032312200233220001 |
5 | 10003113242023403 |
6 | 154244200000001 |
7 | 14040021400351 |
oct | 2166640575001 |
9 | 478821550001 |
10 | 153385892353 |
11 | 5a0613791a1 |
12 | 25888760001 |
13 | 11605ba5b65 |
14 | 75d1328b61 |
15 | 3ecae9bc1d |
hex | 23b682fa01 |
153385892353 has 2 divisors, whose sum is σ = 153385892354. Its totient is φ = 153385892352.
The previous prime is 153385892273. The next prime is 153385892369. The reversal of 153385892353 is 353298583351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111952475649 + 41433416704 = 334593^2 + 203552^2 .
It is a cyclic number.
It is not a de Polignac number, because 153385892353 - 213 = 153385884161 is a prime.
It is a super-2 number, since 2×1533858923532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 153385892294 and 153385892303.
It is not a weakly prime, because it can be changed into another prime (153385892453) 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 as a sum of consecutive naturals, namely, 76692946176 + 76692946177.
It is an arithmetic number, because the mean of its divisors is an integer number (76692946177).
Almost surely, 2153385892353 is an apocalyptic number.
It is an amenable number.
153385892353 is a deficient number, since it is larger than the sum of its proper divisors (1).
153385892353 is an equidigital number, since it uses as much as digits as its factorization.
153385892353 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11664000, while the sum is 55.
The spelling of 153385892353 in words is "one hundred fifty-three billion, three hundred eighty-five million, eight hundred ninety-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •