Base | Representation |
---|---|
bin | 1110110101010010000010… |
… | …1001010111110011111001 |
3 | 2010202002012002110120100102 |
4 | 3231110200221113303321 |
5 | 4114144341331224012 |
6 | 54404012243445145 |
7 | 3302152534230446 |
oct | 355244051276371 |
9 | 63662162416312 |
10 | 16308538539257 |
11 | 521845992a688 |
12 | 19b48546867b5 |
13 | 913b722b6ac3 |
14 | 4054a20729cd |
15 | 1d4350eb22c2 |
hex | ed520a57cf9 |
16308538539257 has 2 divisors, whose sum is σ = 16308538539258. Its totient is φ = 16308538539256.
The previous prime is 16308538539239. The next prime is 16308538539269. The reversal of 16308538539257 is 75293583580361.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10307464354576 + 6001074184681 = 3210524^2 + 2449709^2 .
It is a cyclic number.
It is not a de Polignac number, because 16308538539257 - 26 = 16308538539193 is a prime.
It is a super-2 number, since 2×163085385392572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16308538539193 and 16308538539202.
It is not a weakly prime, because it can be changed into another prime (16308538539277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8154269269628 + 8154269269629.
It is an arithmetic number, because the mean of its divisors is an integer number (8154269269629).
Almost surely, 216308538539257 is an apocalyptic number.
It is an amenable number.
16308538539257 is a deficient number, since it is larger than the sum of its proper divisors (1).
16308538539257 is an equidigital number, since it uses as much as digits as its factorization.
16308538539257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 163296000, while the sum is 65.
The spelling of 16308538539257 in words is "sixteen trillion, three hundred eight billion, five hundred thirty-eight million, five hundred thirty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •