Base | Representation |
---|---|
bin | 1101101100010100110101… |
… | …11111101100001001011011 |
3 | 10221121112000001100221022112 |
4 | 12312022122333230021123 |
5 | 12421311414202211443 |
6 | 144012253543542535 |
7 | 6225253553502011 |
oct | 666123277541133 |
9 | 127545001327275 |
10 | 30110321132123 |
11 | 9659796339511 |
12 | 34636b975aa4b |
13 | 13a551132575b |
14 | 7614c10848b1 |
15 | 37338a1a6b18 |
hex | 1b629afec25b |
30110321132123 has 4 divisors (see below), whose sum is σ = 30278535216840. Its totient is φ = 29942107047408.
The previous prime is 30110321132083. The next prime is 30110321132167. The reversal of 30110321132123 is 32123112301103.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30110321132123 - 232 = 30106026164827 is a prime.
It is a super-4 number, since 4×301103211321234 (a number of 55 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30110326132123) 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, 84107042090 + ... + 84107042447.
It is an arithmetic number, because the mean of its divisors is an integer number (7569633804210).
Almost surely, 230110321132123 is an apocalyptic number.
30110321132123 is a deficient number, since it is larger than the sum of its proper divisors (168214084717).
30110321132123 is a wasteful number, since it uses less digits than its factorization.
30110321132123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168214084716.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 30110321132123 its reverse (32123112301103), we get a palindrome (62233433433226).
The spelling of 30110321132123 in words is "thirty trillion, one hundred ten billion, three hundred twenty-one million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •