Search a number
-
+
10285474901531 is a prime number
BaseRepresentation
bin1001010110101100011000…
…0100111110111000011011
31100102021121102121211022112
42111223012010332320123
52322004123033322111
633513025410542535
72111046441102044
oct225530604767033
940367542554275
1010285474901531
113306055492905
1211a1488897a4b
13597bba9461bb
14277b6914b8cb
1512c837348e8b
hex95ac613ee1b

10285474901531 has 2 divisors, whose sum is σ = 10285474901532. Its totient is φ = 10285474901530.

The previous prime is 10285474901503. The next prime is 10285474901539. The reversal of 10285474901531 is 13510947458201.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10285474901531 - 210 = 10285474900507 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10285474901531.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210285474901531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1209600, while the sum is 50.

The spelling of 10285474901531 in words is "ten trillion, two hundred eighty-five billion, four hundred seventy-four million, nine hundred one thousand, five hundred thirty-one".