Search a number
-
+
30201111112 = 2311713223859
BaseRepresentation
bin11100001000001000…
…000110001001001000
32212221202201101221211
4130020020012021020
5443322441023422
621512454342504
72116261131424
oct341010061110
985852641854
1030201111112
1111898815867
125a2a35aa34
132b03c4b063
141667039b84
15bbb602577
hex708206248

30201111112 has 16 divisors (see below), whose sum is σ = 56675458800. Its totient is φ = 15087655440.

The previous prime is 30201111079. The next prime is 30201111197. The reversal of 30201111112 is 21111110203.

It is a happy number.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1602562 + ... + 1621297.

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

Almost surely, 230201111112 is an apocalyptic number.

It is an amenable number.

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

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

30201111112 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3225036 (or 3225032 counting only the distinct ones).

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 30201111112 its reverse (21111110203), we get a palindrome (51312221315).

Subtracting from 30201111112 its reverse (21111110203), we obtain a palindrome (9090000909).

The spelling of 30201111112 in words is "thirty billion, two hundred one million, one hundred eleven thousand, one hundred twelve".

Divisors: 1 2 4 8 1171 2342 4684 9368 3223859 6447718 12895436 25790872 3775138889 7550277778 15100555556 30201111112