Base | Representation |
---|---|
bin | 10101001010010… |
… | …011101000100101 |
3 | 220202001001112201 |
4 | 111022103220211 |
5 | 1211341222042 |
6 | 55121214501 |
7 | 11540435431 |
oct | 2512235045 |
9 | 822031481 |
10 | 355023397 |
11 | 172446373 |
12 | 9aa91431 |
13 | 58724821 |
14 | 352179c1 |
15 | 2127c1b7 |
hex | 15293a25 |
355023397 has 2 divisors, whose sum is σ = 355023398. Its totient is φ = 355023396.
The previous prime is 355023373. The next prime is 355023407. The reversal of 355023397 is 793320553.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 348718276 + 6305121 = 18674^2 + 2511^2 .
It is an emirp because it is prime and its reverse (793320553) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 355023397 - 27 = 355023269 is a prime.
It is a super-2 number, since 2×3550233972 = 252083224834839218, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (355023497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 177511698 + 177511699.
It is an arithmetic number, because the mean of its divisors is an integer number (177511699).
Almost surely, 2355023397 is an apocalyptic number.
It is an amenable number.
355023397 is a deficient number, since it is larger than the sum of its proper divisors (1).
355023397 is an equidigital number, since it uses as much as digits as its factorization.
355023397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85050, while the sum is 37.
The square root of 355023397 is about 18842.0645630992. The cubic root of 355023397 is about 708.0854303638.
The spelling of 355023397 in words is "three hundred fifty-five million, twenty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •