Base | Representation |
---|---|
bin | 1101101100000101101101… |
… | …11101001110010100001110 |
3 | 10221120202001002121120212200 |
4 | 12312002312331032110032 |
5 | 12421143301240004402 |
6 | 144004432050342330 |
7 | 6224545404616551 |
oct | 666026675162416 |
9 | 127522032546780 |
10 | 30102200313102 |
11 | 96562a934aa35 |
12 | 3462011b8a9a6 |
13 | 13a4818a5c9b8 |
14 | 760d5072a698 |
15 | 37306229321c |
hex | 1b60b6f4e50e |
30102200313102 has 24 divisors (see below), whose sum is σ = 65227018016160. Its totient is φ = 10033207693440.
The previous prime is 30102200313091. The next prime is 30102200313151. The reversal of 30102200313102 is 20131300220103.
30102200313102 is a `hidden beast` number, since 30 + 1 + 0 + 220 + 0 + 313 + 102 = 666.
It is a super-2 number, since 2×301022003131022 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71373702 + ... + 71794217.
It is an arithmetic number, because the mean of its divisors is an integer number (2717792417340).
Almost surely, 230102200313102 is an apocalyptic number.
30102200313102 is an abundant number, since it is smaller than the sum of its proper divisors (35124817703058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30102200313102 is a wasteful number, since it uses less digits than its factorization.
30102200313102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143179608 (or 143179605 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30102200313102 its reverse (20131300220103), we get a palindrome (50233500533205).
The spelling of 30102200313102 in words is "thirty trillion, one hundred two billion, two hundred million, three hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •