Base | Representation |
---|---|
bin | 1101101111010000100100… |
… | …11111100000110110100010 |
3 | 10221222011011012210122021000 |
4 | 12313220102133200312202 |
5 | 12424434323203222403 |
6 | 144130443055412430 |
7 | 6235452321516654 |
oct | 667502237406642 |
9 | 127864135718230 |
10 | 30211110210978 |
11 | 96985071261a4 |
12 | 347b147824116 |
13 | 13b1b84463158 |
14 | 766322c2a6d4 |
15 | 375cd880c7a3 |
hex | 1b7a127e0da2 |
30211110210978 has 64 divisors (see below), whose sum is σ = 67280447404800. Its totient is φ = 10048679700480.
The previous prime is 30211110210977. The next prime is 30211110211031. The reversal of 30211110210978 is 87901201111203.
30211110210978 is a `hidden beast` number, since 30 + 211 + 110 + 210 + 97 + 8 = 666.
It is a super-2 number, since 2×302111102109782 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30211110210977) 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 31 ways as a sum of consecutive naturals, for example, 169102818 + ... + 169281378.
It is an arithmetic number, because the mean of its divisors is an integer number (1051256990700).
Almost surely, 230211110210978 is an apocalyptic number.
30211110210978 is an abundant number, since it is smaller than the sum of its proper divisors (37069337193822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211110210978 is a wasteful number, since it uses less digits than its factorization.
30211110210978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185304 (or 185298 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 36.
The spelling of 30211110210978 in words is "thirty trillion, two hundred eleven billion, one hundred ten million, two hundred ten thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •