Search a number
-
+
356900213698481 is a prime number
BaseRepresentation
bin101000100100110010100111…
…0011101010010111110110001
31201210200022211112112111100002
41101021211032131102332301
5333234423114201322411
63303021410020235345
7135114122002002515
oct12111451635227661
91653608745474302
10356900213698481
11a37a0592299672
123404179b53bb55
131241b712cb608b
14641c0c3762145
152b3dbd85e633b
hex144994e752fb1

356900213698481 has 2 divisors, whose sum is σ = 356900213698482. Its totient is φ = 356900213698480.

The previous prime is 356900213698477. The next prime is 356900213698577. The reversal of 356900213698481 is 184896312009653.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 203493534493456 + 153406679205025 = 14265116^2 + 12385745^2 .

It is a cyclic number.

It is not a de Polignac number, because 356900213698481 - 22 = 356900213698477 is a prime.

It is a super-2 number, since 2×3569002136984812 (a number of 30 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (356900213698471) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 178450106849240 + 178450106849241.

It is an arithmetic number, because the mean of its divisors is an integer number (178450106849241).

Almost surely, 2356900213698481 is an apocalyptic number.

It is an amenable number.

356900213698481 is a deficient number, since it is larger than the sum of its proper divisors (1).

356900213698481 is an equidigital number, since it uses as much as digits as its factorization.

356900213698481 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 67184640, while the sum is 65.

The spelling of 356900213698481 in words is "three hundred fifty-six trillion, nine hundred billion, two hundred thirteen million, six hundred ninety-eight thousand, four hundred eighty-one".