Base | Representation |
---|---|
bin | 1101101110111111110011… |
… | …00000001110100010001111 |
3 | 10221221021220100102222120101 |
4 | 12313133321200032202033 |
5 | 12424312400331024403 |
6 | 144122353105431531 |
7 | 6235013135002156 |
oct | 667377140164217 |
9 | 127837810388511 |
10 | 30202101033103 |
11 | 969470373654a |
12 | 347945263b5a7 |
13 | 13b1079b1b57c |
14 | 765b0a50659d |
15 | 37595c91b71d |
hex | 1b77f980e88f |
30202101033103 has 8 divisors (see below), whose sum is σ = 30240402570000. Its totient is φ = 30163822091520.
The previous prime is 30202101033067. The next prime is 30202101033131. The reversal of 30202101033103 is 30133010120203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30202101033103 - 217 = 30202100902031 is a prime.
It is a super-2 number, since 2×302021010331032 (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 (30202101003103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2973025 + ... + 8321242.
It is an arithmetic number, because the mean of its divisors is an integer number (3780050321250).
Almost surely, 230202101033103 is an apocalyptic number.
30202101033103 is a deficient number, since it is larger than the sum of its proper divisors (38301536897).
30202101033103 is a wasteful number, since it uses less digits than its factorization.
30202101033103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11297657.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30202101033103 its reverse (30133010120203), we get a palindrome (60335111153306).
The spelling of 30202101033103 in words is "thirty trillion, two hundred two billion, one hundred one million, thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •