Base | Representation |
---|---|
bin | 1101101001000111100101… |
… | …00100011011111001111111 |
3 | 10221012222120000211000221002 |
4 | 12310203302210123321333 |
5 | 12413010222013424043 |
6 | 143445510533400515 |
7 | 6214302654014234 |
oct | 664436244337177 |
9 | 127188500730832 |
10 | 30000121233023 |
11 | 9616a86375237 |
12 | 3446283a9913b |
13 | 1397ccb5a8476 |
14 | 75a02950778b |
15 | 37058a774bb8 |
hex | 1b48f291be7f |
30000121233023 has 4 divisors (see below), whose sum is σ = 30810935320440. Its totient is φ = 29189307145608.
The previous prime is 30000121233013. The next prime is 30000121233029. The reversal of 30000121233023 is 32033212100003.
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 30000121233023 - 24 = 30000121233007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30000121232986 and 30000121233004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30000121233029) 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, 405407043653 + ... + 405407043726.
It is an arithmetic number, because the mean of its divisors is an integer number (7702733830110).
Almost surely, 230000121233023 is an apocalyptic number.
30000121233023 is a deficient number, since it is larger than the sum of its proper divisors (810814087417).
30000121233023 is an equidigital number, since it uses as much as digits as its factorization.
30000121233023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810814087416.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30000121233023 its reverse (32033212100003), we get a palindrome (62033333333026).
The spelling of 30000121233023 in words is "thirty trillion, one hundred twenty-one million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •