Base | Representation |
---|---|
bin | 1101101111110100011000… |
… | …01001000011000000110011 |
3 | 10222000222202202010110020212 |
4 | 12313322030021003000303 |
5 | 12430243204214323443 |
6 | 144143342232054335 |
7 | 6240032532601115 |
oct | 667721411030063 |
9 | 128028682113225 |
10 | 30230331011123 |
11 | 96a567a8308a1 |
12 | 3482a108343ab |
13 | 13b392858b589 |
14 | 76722783d3b5 |
15 | 376560e5e618 |
hex | 1b7e8c243033 |
30230331011123 has 8 divisors (see below), whose sum is σ = 31830449016720. Its totient is φ = 28631117800800.
The previous prime is 30230331011119. The next prime is 30230331011129. The reversal of 30230331011123 is 32111013303203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30230331011123 - 22 = 30230331011119 is a prime.
It is a super-2 number, since 2×302303310111232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30230331011129) 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, 226130228 + ... + 226263873.
It is an arithmetic number, because the mean of its divisors is an integer number (3978806127090).
Almost surely, 230230331011123 is an apocalyptic number.
30230331011123 is a deficient number, since it is larger than the sum of its proper divisors (1600118005597).
30230331011123 is a wasteful number, since it uses less digits than its factorization.
30230331011123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452397637.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 30230331011123 its reverse (32111013303203), we get a palindrome (62341344314326).
The spelling of 30230331011123 in words is "thirty trillion, two hundred thirty billion, three hundred thirty-one million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •