Base | Representation |
---|---|
bin | 1101101001011100001101… |
… | …11011101111000010000001 |
3 | 10221021001011011001010002210 |
4 | 12310232012323233002001 |
5 | 12413200414234200413 |
6 | 143454542144332333 |
7 | 6215144343401412 |
oct | 664560673570201 |
9 | 127231134033083 |
10 | 30011200303233 |
11 | 96207511a9706 |
12 | 34484563140a9 |
13 | 13990759c8c06 |
14 | 75a79aabb809 |
15 | 3709d82323c3 |
hex | 1b4b86eef081 |
30011200303233 has 16 divisors (see below), whose sum is σ = 41659383080576. Its totient is φ = 19200057056640.
The previous prime is 30011200303187. The next prime is 30011200303277. The reversal of 30011200303233 is 33230300211003.
It is not a de Polignac number, because 30011200303233 - 212 = 30011200299137 is a prime.
It is a super-2 number, since 2×300112003032332 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30011200302233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1851849253 + ... + 1851865458.
It is an arithmetic number, because the mean of its divisors is an integer number (2603711442536).
Almost surely, 230011200303233 is an apocalyptic number.
It is an amenable number.
30011200303233 is a deficient number, since it is larger than the sum of its proper divisors (11648182777343).
30011200303233 is a wasteful number, since it uses less digits than its factorization.
30011200303233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3703714824.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30011200303233 its reverse (33230300211003), we get a palindrome (63241500514236).
The spelling of 30011200303233 in words is "thirty trillion, eleven billion, two hundred million, three hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •