Base | Representation |
---|---|
bin | 11011111100101111… |
… | …001011011111010001 |
3 | 2212110110011110222211 |
4 | 123330233023133101 |
5 | 442430031430113 |
6 | 21441511032121 |
7 | 2111451021634 |
oct | 337457133721 |
9 | 85413143884 |
10 | 30010030033 |
11 | 117aa974815 |
12 | 599636b641 |
13 | 2aa3497529 |
14 | 16498d9c1b |
15 | ba995ab3d |
hex | 6fcbcb7d1 |
30010030033 has 4 divisors (see below), whose sum is σ = 30091801600. Its totient is φ = 29928258468.
The previous prime is 30010030003. The next prime is 30010030081. The reversal of 30010030033 is 33003001003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30010030033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30010029995 and 30010030022.
It is not an unprimeable number, because it can be changed into a prime (30010030003) 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, 40885233 + ... + 40885966.
It is an arithmetic number, because the mean of its divisors is an integer number (7522950400).
Almost surely, 230010030033 is an apocalyptic number.
It is an amenable number.
30010030033 is a deficient number, since it is larger than the sum of its proper divisors (81771567).
30010030033 is an equidigital number, since it uses as much as digits as its factorization.
30010030033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81771566.
The product of its (nonzero) digits is 81, while the sum is 13.
Adding to 30010030033 its reverse (33003001003), we get a palindrome (63013031036).
The spelling of 30010030033 in words is "thirty billion, ten million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •