Base | Representation |
---|---|
bin | 11011111100111010… |
… | …111001010011110101 |
3 | 2212110122221111222111 |
4 | 123330322321103311 |
5 | 442431323220201 |
6 | 21442100531021 |
7 | 2111516103031 |
oct | 337472712365 |
9 | 85418844874 |
10 | 30013101301 |
11 | 11801682257 |
12 | 59973b0a71 |
13 | 2aa4001451 |
14 | 164a0991c1 |
15 | ba9d65b51 |
hex | 6fceb94f5 |
30013101301 has 8 divisors (see below), whose sum is σ = 30842129304. Its totient is φ = 29188692480.
The previous prime is 30013101289. The next prime is 30013101311. The reversal of 30013101301 is 10310131003.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3161363076 + 26851738225 = 56226^2 + 163865^2 .
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 30013101301 - 223 = 30004712693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30013101311) 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 7 ways as a sum of consecutive naturals, for example, 1141620 + ... + 1167613.
It is an arithmetic number, because the mean of its divisors is an integer number (3855266163).
Almost surely, 230013101301 is an apocalyptic number.
It is an amenable number.
30013101301 is a deficient number, since it is larger than the sum of its proper divisors (829028003).
30013101301 is a wasteful number, since it uses less digits than its factorization.
30013101301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2309591.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 30013101301 its reverse (10310131003), we get a palindrome (40323232304).
The spelling of 30013101301 in words is "thirty billion, thirteen million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •