Base | Representation |
---|---|
bin | 1101101100111101110011… |
… | …10000100100110111001101 |
3 | 10221200121202122020212110102 |
4 | 12312132321300210313031 |
5 | 12422141433344202201 |
6 | 144030332034420445 |
7 | 6226662532602605 |
oct | 666367160446715 |
9 | 127617678225412 |
10 | 30132312100301 |
11 | 96680506a6384 |
12 | 3467a16431725 |
13 | 13a7607334768 |
14 | 7625a9953c05 |
15 | 373c25aee26b |
hex | 1b67b9c24dcd |
30132312100301 has 4 divisors (see below), whose sum is σ = 30132639081600. Its totient is φ = 30131985119004.
The previous prime is 30132312100291. The next prime is 30132312100307. The reversal of 30132312100301 is 10300121323103.
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 a cyclic number.
It is not a de Polignac number, because 30132312100301 - 26 = 30132312100237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30132312100307) 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, 163352381 + ... + 163536738.
It is an arithmetic number, because the mean of its divisors is an integer number (7533159770400).
Almost surely, 230132312100301 is an apocalyptic number.
It is an amenable number.
30132312100301 is a deficient number, since it is larger than the sum of its proper divisors (326981299).
30132312100301 is an equidigital number, since it uses as much as digits as its factorization.
30132312100301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326981298.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30132312100301 its reverse (10300121323103), we get a palindrome (40432433423404).
The spelling of 30132312100301 in words is "thirty trillion, one hundred thirty-two billion, three hundred twelve million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •