Base | Representation |
---|---|
bin | 1101110010110010001000… |
… | …01000011010110111000101 |
3 | 10222101201201022120001221120 |
4 | 12321121010020122313011 |
5 | 12433430322214232323 |
6 | 144302230555104153 |
7 | 6250300146563514 |
oct | 671310410326705 |
9 | 128351638501846 |
10 | 30332202102213 |
11 | 97348a6367370 |
12 | 349a701142059 |
13 | 13c041191c3bb |
14 | 76c12d1a067b |
15 | 3790245965e3 |
hex | 1b964421adc5 |
30332202102213 has 8 divisors (see below), whose sum is σ = 44119566694176. Its totient is φ = 18383152789200.
The previous prime is 30332202102149. The next prime is 30332202102221. The reversal of 30332202102213 is 31220120223303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30332202102213 - 26 = 30332202102149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30332202102113) 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, 459578819698 + ... + 459578819763.
It is an arithmetic number, because the mean of its divisors is an integer number (5514945836772).
Almost surely, 230332202102213 is an apocalyptic number.
30332202102213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
30332202102213 is a deficient number, since it is larger than the sum of its proper divisors (13787364591963).
30332202102213 is a wasteful number, since it uses less digits than its factorization.
30332202102213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919157639475.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 30332202102213 its reverse (31220120223303), we get a palindrome (61552322325516).
The spelling of 30332202102213 in words is "thirty trillion, three hundred thirty-two billion, two hundred two million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •