Base | Representation |
---|---|
bin | 1101101100000101111011… |
… | …01000100010001101110110 |
3 | 10221120202022220101122022110 |
4 | 12312002331220202031312 |
5 | 12421144013424030402 |
6 | 144004451131311450 |
7 | 6224551235011665 |
oct | 666027550421566 |
9 | 127522286348273 |
10 | 30102312330102 |
11 | 96563565a9a71 |
12 | 34620435ab586 |
13 | 13a483602014c |
14 | 760d61568ddc |
15 | 37306c01d56c |
hex | 1b60bda22376 |
30102312330102 has 16 divisors (see below), whose sum is σ = 60344310569472. Its totient is φ = 10010823125160.
The previous prime is 30102312330067. The next prime is 30102312330109. The reversal of 30102312330102 is 20103321320103.
It is a super-2 number, since 2×301023123301022 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30102312330109) 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 7 ways as a sum of consecutive naturals, for example, 5820243418 + ... + 5820248589.
It is an arithmetic number, because the mean of its divisors is an integer number (3771519410592).
Almost surely, 230102312330102 is an apocalyptic number.
30102312330102 is an abundant number, since it is smaller than the sum of its proper divisors (30241998239370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30102312330102 is a wasteful number, since it uses less digits than its factorization.
30102312330102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11640492443.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30102312330102 its reverse (20103321320103), we get a palindrome (50205633650205).
The spelling of 30102312330102 in words is "thirty trillion, one hundred two billion, three hundred twelve million, three hundred thirty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •