Base | Representation |
---|---|
bin | 1101101111110100011001… |
… | …11100010010010111000011 |
3 | 10222000222210200101212210001 |
4 | 12313322030330102113003 |
5 | 12430243221134141311 |
6 | 144143343432020431 |
7 | 6240033055014064 |
oct | 667721474222703 |
9 | 128028720355701 |
10 | 30230344443331 |
11 | 96a568737569a |
12 | 3482a15231717 |
13 | 13b392b2b2426 |
14 | 76722953856b |
15 | 3765622144c1 |
hex | 1b7e8cf125c3 |
30230344443331 has 4 divisors (see below), whose sum is σ = 30265373812032. Its totient is φ = 30195315074632.
The previous prime is 30230344443319. The next prime is 30230344443373. The reversal of 30230344443331 is 13334444303203.
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 30230344443331 - 213 = 30230344435139 is a prime.
It is a super-2 number, since 2×302303444433312 (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 (30230344444331) 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, 17514683056 + ... + 17514684781.
It is an arithmetic number, because the mean of its divisors is an integer number (7566343453008).
Almost surely, 230230344443331 is an apocalyptic number.
30230344443331 is a deficient number, since it is larger than the sum of its proper divisors (35029368701).
30230344443331 is an equidigital number, since it uses as much as digits as its factorization.
30230344443331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35029368700.
The product of its (nonzero) digits is 373248, while the sum is 37.
Adding to 30230344443331 its reverse (13334444303203), we get a palindrome (43564788746534).
The spelling of 30230344443331 in words is "thirty trillion, two hundred thirty billion, three hundred forty-four million, four hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •