Base | Representation |
---|---|
bin | 11100011110011011… |
… | …100010000110110101 |
3 | 2220220211211102122221 |
4 | 130132123202012311 |
5 | 1000104234231031 |
6 | 22013542522341 |
7 | 2131453543213 |
oct | 343633420665 |
9 | 86824742587 |
10 | 30575305141 |
11 | 11a6aa65327 |
12 | 5b137363b1 |
13 | 2b63625644 |
14 | 16a0a03cb3 |
15 | bde3b9a11 |
hex | 71e6e21b5 |
30575305141 has 8 divisors (see below), whose sum is σ = 30994430720. Its totient is φ = 30156982128.
The previous prime is 30575305121. The next prime is 30575305157. The reversal of 30575305141 is 14150357503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30575305141 - 29 = 30575304629 is a prime.
It is a super-2 number, since 2×305753051412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30575305097 and 30575305106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30575305121) by changing a digit.
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, 123726 + ... + 276511.
It is an arithmetic number, because the mean of its divisors is an integer number (3874303840).
Almost surely, 230575305141 is an apocalyptic number.
It is an amenable number.
30575305141 is a deficient number, since it is larger than the sum of its proper divisors (419125579).
30575305141 is an equidigital number, since it uses as much as digits as its factorization.
30575305141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401283.
The product of its (nonzero) digits is 31500, while the sum is 34.
The spelling of 30575305141 in words is "thirty billion, five hundred seventy-five million, three hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •