Base | Representation |
---|---|
bin | 1101101100000001100… |
… | …0111110001001010001 |
3 | 211110222102111210200121 |
4 | 3123000120332021101 |
5 | 12323044414133312 |
6 | 300010145150241 |
7 | 22663246031512 |
oct | 3330030761121 |
9 | 743872453617 |
10 | 235156005457 |
11 | 9080248646a |
12 | 396a932b381 |
13 | 19237965379 |
14 | b54b1daa09 |
15 | 61b4a6d707 |
hex | 36c063e251 |
235156005457 has 2 divisors, whose sum is σ = 235156005458. Its totient is φ = 235156005456.
The previous prime is 235156005449. The next prime is 235156005493. The reversal of 235156005457 is 754500651532.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 156930068736 + 78225936721 = 396144^2 + 279689^2 .
It is a cyclic number.
It is not a de Polignac number, because 235156005457 - 23 = 235156005449 is a prime.
It is a super-2 number, since 2×2351560054572 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (235156005257) 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, 117578002728 + 117578002729.
It is an arithmetic number, because the mean of its divisors is an integer number (117578002729).
Almost surely, 2235156005457 is an apocalyptic number.
It is an amenable number.
235156005457 is a deficient number, since it is larger than the sum of its proper divisors (1).
235156005457 is an equidigital number, since it uses as much as digits as its factorization.
235156005457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630000, while the sum is 43.
Adding to 235156005457 its reverse (754500651532), we get a palindrome (989656656989).
The spelling of 235156005457 in words is "two hundred thirty-five billion, one hundred fifty-six million, five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •