Base | Representation |
---|---|
bin | 1101101100111001111010… |
… | …01011111110101111101000 |
3 | 10221200102100222121111012110 |
4 | 12312130331023332233220 |
5 | 12422123143331212300 |
6 | 144025344415242320 |
7 | 6226556664300261 |
oct | 666347513765750 |
9 | 127612328544173 |
10 | 30130222132200 |
11 | 966717899a413 |
12 | 34675325193a0 |
13 | 13a7363349b48 |
14 | 76244c159968 |
15 | 373b523b9550 |
hex | 1b673d2febe8 |
30130222132200 has 48 divisors (see below), whose sum is σ = 93403688611680. Its totient is φ = 8034725901760.
The previous prime is 30130222132121. The next prime is 30130222132223. The reversal of 30130222132200 is 223122203103.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25108517844 + ... + 25108519043.
It is an arithmetic number, because the mean of its divisors is an integer number (1945910179410).
Almost surely, 230130222132200 is an apocalyptic number.
30130222132200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30130222132200 is an abundant number, since it is smaller than the sum of its proper divisors (63273466479480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30130222132200 is a wasteful number, since it uses less digits than its factorization.
30130222132200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50217036906 (or 50217036897 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 30130222132200 its reverse (223122203103), we get a palindrome (30353344335303).
The spelling of 30130222132200 in words is "thirty trillion, one hundred thirty billion, two hundred twenty-two million, one hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •