Base | Representation |
---|---|
bin | 1101110000011101000000… |
… | …11000011100111010001000 |
3 | 10222010002002000210202111101 |
4 | 12320032200120130322020 |
5 | 12431122343212231102 |
6 | 144201351014511144 |
7 | 6241434236235322 |
oct | 670164030347210 |
9 | 128102060722441 |
10 | 30252145430152 |
11 | 9703954472778 |
12 | 348709a3654b4 |
13 | 13b59c3b34329 |
14 | 7682d6ab2612 |
15 | 376ddb130e87 |
hex | 1b83a061ce88 |
30252145430152 has 8 divisors (see below), whose sum is σ = 56722772681550. Its totient is φ = 15126072715072.
The previous prime is 30252145430149. The next prime is 30252145430173. The reversal of 30252145430152 is 25103454125203.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 19524856665636 + 10727288764516 = 4418694^2 + 3275254^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×302521454301522 (a number of 28 digits) contains 22 as substring.
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 as a sum of consecutive naturals, namely, 1890759089377 + ... + 1890759089392.
Almost surely, 230252145430152 is an apocalyptic number.
It is an amenable number.
30252145430152 is a deficient number, since it is larger than the sum of its proper divisors (26470627251398).
30252145430152 is a wasteful number, since it uses less digits than its factorization.
30252145430152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3781518178775 (or 3781518178771 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 30252145430152 its reverse (25103454125203), we get a palindrome (55355599555355).
The spelling of 30252145430152 in words is "thirty trillion, two hundred fifty-two billion, one hundred forty-five million, four hundred thirty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •