Base | Representation |
---|---|
bin | 1101101110111110001001… |
… | …11111110111000110111111 |
3 | 10221221012121221212122020011 |
4 | 12313133010333313012333 |
5 | 12424304044323231221 |
6 | 144122125441004051 |
7 | 6234652250324203 |
oct | 667370477670677 |
9 | 127835557778204 |
10 | 30201220133311 |
11 | 96942a146a497 |
12 | 3479247623627 |
13 | 13b0c694818a6 |
14 | 765a6551cb03 |
15 | 37590a4141e1 |
hex | 1b77c4ff71bf |
30201220133311 has 4 divisors (see below), whose sum is σ = 31977762494112. Its totient is φ = 28424677772512.
The previous prime is 30201220133299. The next prime is 30201220133317. The reversal of 30201220133311 is 11333102210203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30201220133311 - 213 = 30201220125119 is a prime.
It is a super-2 number, since 2×302012201333112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201220133317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 888271180375 + ... + 888271180408.
It is an arithmetic number, because the mean of its divisors is an integer number (7994440623528).
Almost surely, 230201220133311 is an apocalyptic number.
30201220133311 is a deficient number, since it is larger than the sum of its proper divisors (1776542360801).
30201220133311 is a wasteful number, since it uses less digits than its factorization.
30201220133311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1776542360800.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30201220133311 its reverse (11333102210203), we get a palindrome (41534322343514).
The spelling of 30201220133311 in words is "thirty trillion, two hundred one billion, two hundred twenty million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •