Search a number
-
+
10230201213 = 310955756167
BaseRepresentation
bin10011000011100010…
…00111101101111101
3222101221221001211020
421201301013231331
5131422412414323
64411044414353
7511341163341
oct114161075575
928357831736
1010230201213
11437a755651
121b960a73b9
13c705ba1cb
146d0967621
153ed1d0ae3
hex261c47b7d

10230201213 has 16 divisors (see below), whose sum is σ = 13790367360. Its totient is φ = 6745311936.

The previous prime is 10230201187. The next prime is 10230201277. The reversal of 10230201213 is 31210203201.

It is not a de Polignac number, because 10230201213 - 28 = 10230200957 is a prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 10230201192 and 10230201201.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10230201613) by changing a digit.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 154056 + ... + 210222.

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

Almost surely, 210230201213 is an apocalyptic number.

It is an amenable number.

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

10230201213 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 56836.

The product of its (nonzero) digits is 72, while the sum is 15.

Adding to 10230201213 its reverse (31210203201), we get a palindrome (41440404414).

The spelling of 10230201213 in words is "ten billion, two hundred thirty million, two hundred one thousand, two hundred thirteen".

Divisors: 1 3 109 327 557 1671 56167 60713 168501 182139 6122203 18366609 31285019 93855057 3410067071 10230201213