Base | Representation |
---|---|
bin | 1101101111100011000001… |
… | …01000001001000011000100 |
3 | 10222000002201012221100221200 |
4 | 12313301200220021003010 |
5 | 12430120112310431322 |
6 | 144135201340342500 |
7 | 6236252553221112 |
oct | 667614050110304 |
9 | 128002635840850 |
10 | 30221011030212 |
11 | 96a1727959232 |
12 | 348104b544a30 |
13 | 13b2aa1735982 |
14 | 7669c1b32ab2 |
15 | 3761b7b288ac |
hex | 1b7c60a090c4 |
30221011030212 has 72 divisors (see below), whose sum is σ = 79529559072600. Its totient is φ = 9664351377408.
The previous prime is 30221011030151. The next prime is 30221011030219. The reversal of 30221011030212 is 21203011012203.
30221011030212 is a `hidden beast` number, since 30 + 2 + 210 + 110 + 302 + 12 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 6571716823296 + 23649294206916 = 2563536^2 + 4863054^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (30221011030219) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 92025037 + ... + 92352852.
Almost surely, 230221011030212 is an apocalyptic number.
It is an amenable number.
30221011030212 is an abundant number, since it is smaller than the sum of its proper divisors (49308548042388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30221011030212 is a wasteful number, since it uses less digits than its factorization.
30221011030212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184378085 (or 184378080 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30221011030212 its reverse (21203011012203), we get a palindrome (51424022042415).
The spelling of 30221011030212 in words is "thirty trillion, two hundred twenty-one billion, eleven million, thirty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •