Base | Representation |
---|---|
bin | 1101110000011100110011… |
… | …00000100101100111000000 |
3 | 10222010001202222211112001002 |
4 | 12320032121200211213000 |
5 | 12431122124202404212 |
6 | 144201331335231132 |
7 | 6241431336156236 |
oct | 670163140454700 |
9 | 128101688745032 |
10 | 30252030122432 |
11 | 97038a5376338 |
12 | 34870678184a8 |
13 | 13b59a5c91101 |
14 | 7682c5658956 |
15 | 376dd0e55ac2 |
hex | 1b83998259c0 |
30252030122432 has 56 divisors (see below), whose sum is σ = 60133019047920. Its totient is φ = 15100424939520.
The previous prime is 30252030122429. The next prime is 30252030122521. The reversal of 30252030122432 is 23422103025203.
It is a junction number, because it is equal to n+sod(n) for n = 30252030122395 and 30252030122404.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89835332 + ... + 90171452.
It is an arithmetic number, because the mean of its divisors is an integer number (1073803911570).
Almost surely, 230252030122432 is an apocalyptic number.
30252030122432 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30252030122432 is a deficient number, since it is larger than the sum of its proper divisors (29880988925488).
30252030122432 is a wasteful number, since it uses less digits than its factorization.
30252030122432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338509 (or 338499 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 29.
Adding to 30252030122432 its reverse (23422103025203), we get a palindrome (53674133147635).
The spelling of 30252030122432 in words is "thirty trillion, two hundred fifty-two billion, thirty million, one hundred twenty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •