Base | Representation |
---|---|
bin | 1101101100101100100001… |
… | …00001000001100011111101 |
3 | 10221122201210202202122121210 |
4 | 12312112100201001203331 |
5 | 12422013431214114401 |
6 | 144022155023515033 |
7 | 6226213525132254 |
oct | 666262041014375 |
9 | 127581722678553 |
10 | 30123030223101 |
11 | 9664118289692 |
12 | 3466065a58a79 |
13 | 13a678836052a |
14 | 761d68d2579b |
15 | 373880ce34d6 |
hex | 1b65908418fd |
30123030223101 has 4 divisors (see below), whose sum is σ = 40164040297472. Its totient is φ = 20082020148732.
The previous prime is 30123030223079. The next prime is 30123030223141. The reversal of 30123030223101 is 10132203032103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 30123030223101 - 227 = 30122896005373 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30123030223141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5020505037181 + ... + 5020505037186.
It is an arithmetic number, because the mean of its divisors is an integer number (10041010074368).
Almost surely, 230123030223101 is an apocalyptic number.
It is an amenable number.
30123030223101 is a deficient number, since it is larger than the sum of its proper divisors (10041010074371).
30123030223101 is a wasteful number, since it uses less digits than its factorization.
30123030223101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10041010074370.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30123030223101 its reverse (10132203032103), we get a palindrome (40255233255204).
The spelling of 30123030223101 in words is "thirty trillion, one hundred twenty-three billion, thirty million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •