Base | Representation |
---|---|
bin | 11100010001010011… |
… | …001000111011100101 |
3 | 2220100111021211021120 |
4 | 130101103020323211 |
5 | 444131340013221 |
6 | 21540033004153 |
7 | 2123140152240 |
oct | 342123107345 |
9 | 86314254246 |
10 | 30355001061 |
11 | 11967674640 |
12 | 5a719b3659 |
13 | 2b29aac6b8 |
14 | 167d658257 |
15 | bc9d9e5c6 |
hex | 7114c8ee5 |
30355001061 has 16 divisors (see below), whose sum is σ = 50460261888. Its totient is φ = 15768831600.
The previous prime is 30355000999. The next prime is 30355001101. The reversal of 30355001061 is 16010055303.
It is not a de Polignac number, because 30355001061 - 27 = 30355000933 is a prime.
It is a super-2 number, since 2×303550010612 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30355001461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65703235 + ... + 65703696.
It is an arithmetic number, because the mean of its divisors is an integer number (3153766368).
Almost surely, 230355001061 is an apocalyptic number.
It is an amenable number.
30355001061 is a deficient number, since it is larger than the sum of its proper divisors (20105260827).
30355001061 is a wasteful number, since it uses less digits than its factorization.
30355001061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131406952.
The product of its (nonzero) digits is 1350, while the sum is 24.
Adding to 30355001061 its reverse (16010055303), we get a palindrome (46365056364).
The spelling of 30355001061 in words is "thirty billion, three hundred fifty-five million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •