Search a number
-
+
10890472213 is a prime number
BaseRepresentation
bin10100010010001111…
…10110101100010101
31001002222100022100201
422021013312230111
5134300430102323
65000352340501
7533606325565
oct121107665425
931088308321
1010890472213
114689429a65
12213b244731
1310473291ca
1475451cda5
1543b1568ad
hex2891f6b15

10890472213 has 2 divisors, whose sum is σ = 10890472214. Its totient is φ = 10890472212.

The previous prime is 10890472211. The next prime is 10890472253. The reversal of 10890472213 is 31227409801.

10890472213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7563259089 + 3327213124 = 86967^2 + 57682^2 .

It is a cyclic number.

It is not a de Polignac number, because 10890472213 - 21 = 10890472211 is a prime.

Together with 10890472211, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10890472211) 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, 5445236106 + 5445236107.

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

Almost surely, 210890472213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24192, while the sum is 37.

The spelling of 10890472213 in words is "ten billion, eight hundred ninety million, four hundred seventy-two thousand, two hundred thirteen".