Base | Representation |
---|---|
bin | 11011111100110010… |
… | …111011011110010011 |
3 | 2212110112000102101102 |
4 | 123330302323132103 |
5 | 442430304404021 |
6 | 21441544055015 |
7 | 2111462254520 |
oct | 337462733623 |
9 | 85415012342 |
10 | 30011013011 |
11 | 118004862a1 |
12 | 599676446b |
13 | 2aa374ca85 |
14 | 1649ab4147 |
15 | ba9aa200b |
hex | 6fccbb793 |
30011013011 has 4 divisors (see below), whose sum is σ = 34298300592. Its totient is φ = 25723725432.
The previous prime is 30011013001. The next prime is 30011013013. The reversal of 30011013011 is 11031011003.
It is a happy number.
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 30011013011 - 214 = 30010996627 is a prime.
It is a super-2 number, since 2×300110130112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30011012983 and 30011013001.
It is not an unprimeable number, because it can be changed into a prime (30011013013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2143643780 + ... + 2143643793.
It is an arithmetic number, because the mean of its divisors is an integer number (8574575148).
Almost surely, 230011013011 is an apocalyptic number.
30011013011 is a deficient number, since it is larger than the sum of its proper divisors (4287287581).
30011013011 is an equidigital number, since it uses as much as digits as its factorization.
30011013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4287287580.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 30011013011 its reverse (11031011003), we get a palindrome (41042024014).
The spelling of 30011013011 in words is "thirty billion, eleven million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •