Base | Representation |
---|---|
bin | 1110000101010010111000… |
… | …10101010001000111000001 |
3 | 11001122112111111212220221021 |
4 | 13002221130111101013001 |
5 | 13024341000400030022 |
6 | 145510342421425441 |
7 | 6344245301452015 |
oct | 702513425210701 |
9 | 131575444786837 |
10 | 30968263283137 |
11 | 995a626311924 |
12 | 3581a3486b281 |
13 | 14383aa5ac08b |
14 | 790c2c866545 |
15 | 38a85020d7c7 |
hex | 1c2a5c5511c1 |
30968263283137 has 4 divisors (see below), whose sum is σ = 30979962667456. Its totient is φ = 30956563898820.
The previous prime is 30968263283119. The next prime is 30968263283159. The reversal of 30968263283137 is 73138236286903.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30968263283137 - 215 = 30968263250369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30968263280137) 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 3 ways as a sum of consecutive naturals, for example, 5849688189 + ... + 5849693482.
It is an arithmetic number, because the mean of its divisors is an integer number (7744990666864).
Almost surely, 230968263283137 is an apocalyptic number.
It is an amenable number.
30968263283137 is a deficient number, since it is larger than the sum of its proper divisors (11699384319).
30968263283137 is a wasteful number, since it uses less digits than its factorization.
30968263283137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11699384318.
The product of its (nonzero) digits is 47029248, while the sum is 61.
The spelling of 30968263283137 in words is "thirty trillion, nine hundred sixty-eight billion, two hundred sixty-three million, two hundred eighty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •