Base | Representation |
---|---|
bin | 1101101101010111010011… |
… | …01101001110110000010101 |
3 | 10221201221002200010221122202 |
4 | 12312223221231032300111 |
5 | 12422403002331302243 |
6 | 144040514252334245 |
7 | 6230656006155446 |
oct | 666535155166025 |
9 | 127657080127582 |
10 | 30146001431573 |
11 | 96729359a35a5 |
12 | 346a5b6a74385 |
13 | 13a89a947b791 |
14 | 763107a7b2cd |
15 | 3742778174b8 |
hex | 1b6ae9b4ec15 |
30146001431573 has 16 divisors (see below), whose sum is σ = 31780904643072. Its totient is φ = 28555116408000.
The previous prime is 30146001431549. The next prime is 30146001431597. The reversal of 30146001431573 is 37513410064103.
It is an interprime number because it is at equal distance from previous prime (30146001431549) and next prime (30146001431597).
It is a cyclic number.
It is not a de Polignac number, because 30146001431573 - 216 = 30146001366037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30146001431473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21099443 + ... + 22482848.
It is an arithmetic number, because the mean of its divisors is an integer number (1986306540192).
Almost surely, 230146001431573 is an apocalyptic number.
It is an amenable number.
30146001431573 is a deficient number, since it is larger than the sum of its proper divisors (1634903211499).
30146001431573 is a wasteful number, since it uses less digits than its factorization.
30146001431573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43582796.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 30146001431573 its reverse (37513410064103), we get a palindrome (67659411495676).
The spelling of 30146001431573 in words is "thirty trillion, one hundred forty-six billion, one million, four hundred thirty-one thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •