Search a number
-
+
30201211023 = 3411032383867
BaseRepresentation
bin11100001000001000…
…011110100010001111
32212221202220111000020
4130020020132202033
5443323002223043
621512500433223
72116262025624
oct341010364217
985852814006
1030201211023
1111898883935
125a2a3a8813
132b03c84689
14166706434b
15bbb621e83
hex70821e88f

30201211023 has 16 divisors (see below), whose sum is σ = 41650941696. Its totient is φ = 19452346560.

The previous prime is 30201210983. The next prime is 30201211043. The reversal of 30201211023 is 32011210203.

It is not a de Polignac number, because 30201211023 - 210 = 30201209999 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 230201211023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2384014.

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

Adding to 30201211023 its reverse (32011210203), we get a palindrome (62212421226).

The spelling of 30201211023 in words is "thirty billion, two hundred one million, two hundred eleven thousand, twenty-three".

Divisors: 1 3 41 103 123 309 4223 12669 2383867 7151601 97738547 245538301 293215641 736614903 10067070341 30201211023