Base | Representation |
---|---|
bin | 1101101100101101000001… |
… | …10010100000010110001101 |
3 | 10221122202111210111101220120 |
4 | 12312112200302200112031 |
5 | 12422020011112203401 |
6 | 144022242055335153 |
7 | 6226223351553150 |
oct | 666264062402615 |
9 | 127582453441816 |
10 | 30123303241101 |
11 | 96642484040a4 |
12 | 34661213814b9 |
13 | 13a67ccaa1c45 |
14 | 761d932b3c97 |
15 | 373899c72836 |
hex | 1b65a0ca058d |
30123303241101 has 8 divisors (see below), whose sum is σ = 45902176367424. Its totient is φ = 17213316137760.
The previous prime is 30123303241049. The next prime is 30123303241169. The reversal of 30123303241101 is 10114230332103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30123303241101 - 27 = 30123303240973 is a prime.
It is a super-2 number, since 2×301233032411012 (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 (30123303241201) 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, 717221505720 + ... + 717221505761.
It is an arithmetic number, because the mean of its divisors is an integer number (5737772045928).
Almost surely, 230123303241101 is an apocalyptic number.
It is an amenable number.
30123303241101 is a deficient number, since it is larger than the sum of its proper divisors (15778873126323).
30123303241101 is a wasteful number, since it uses less digits than its factorization.
30123303241101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1434443011491.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 30123303241101 its reverse (10114230332103), we get a palindrome (40237533573204).
The spelling of 30123303241101 in words is "thirty trillion, one hundred twenty-three billion, three hundred three million, two hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •