Base | Representation |
---|---|
bin | 1101101111010010100111… |
… | …00000101010010101011001 |
3 | 10221222020222020101001000121 |
4 | 12313221103200222111121 |
5 | 12424444041430443001 |
6 | 144131143223433241 |
7 | 6235521335400163 |
oct | 667512340522531 |
9 | 127866866331017 |
10 | 30212201031001 |
11 | 9698a16940450 |
12 | 347b3b0bb5821 |
13 | 13b1cc944b5a2 |
14 | 7663c7a59933 |
15 | 375d4e47d6a1 |
hex | 1b7a5382a559 |
30212201031001 has 16 divisors (see below), whose sum is σ = 33132868179840. Its totient is φ = 27320769809280.
The previous prime is 30212201030911. The next prime is 30212201031017. The reversal of 30212201031001 is 10013010221203.
It is a cyclic number.
It is not a de Polignac number, because 30212201031001 - 221 = 30212198933849 is a prime.
It is a super-2 number, since 2×302122010310012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30212201031101) 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 15 ways as a sum of consecutive naturals, for example, 2703261 + ... + 8229946.
It is an arithmetic number, because the mean of its divisors is an integer number (2070804261240).
Almost surely, 230212201031001 is an apocalyptic number.
It is an amenable number.
30212201031001 is a deficient number, since it is larger than the sum of its proper divisors (2920667148839).
30212201031001 is a wasteful number, since it uses less digits than its factorization.
30212201031001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10934544.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 30212201031001 its reverse (10013010221203), we get a palindrome (40225211252204).
The spelling of 30212201031001 in words is "thirty trillion, two hundred twelve billion, two hundred one million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •