Base | Representation |
---|---|
bin | 11110010001101110… |
… | …10111101011000001 |
3 | 1112221211101102221201 |
4 | 33020313113223001 |
5 | 231242221004334 |
6 | 11244542021201 |
7 | 1113545013205 |
oct | 171067275301 |
9 | 45854342851 |
10 | 16254859969 |
11 | 6991498977 |
12 | 3197877801 |
13 | 16c080aa4a |
14 | b02b54b05 |
15 | 652089c14 |
hex | 3c8dd7ac1 |
16254859969 has 2 divisors, whose sum is σ = 16254859970. Its totient is φ = 16254859968.
The previous prime is 16254859967. The next prime is 16254859987. The reversal of 16254859969 is 96995845261.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12496556944 + 3758303025 = 111788^2 + 61305^2 .
It is a cyclic number.
It is not a de Polignac number, because 16254859969 - 21 = 16254859967 is a prime.
It is a super-2 number, since 2×162548599692 (a number of 21 digits) contains 22 as substring.
Together with 16254859967, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 16254859969.
It is not a weakly prime, because it can be changed into another prime (16254859967) 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 as a sum of consecutive naturals, namely, 8127429984 + 8127429985.
It is an arithmetic number, because the mean of its divisors is an integer number (8127429985).
Almost surely, 216254859969 is an apocalyptic number.
It is an amenable number.
16254859969 is a deficient number, since it is larger than the sum of its proper divisors (1).
16254859969 is an equidigital number, since it uses as much as digits as its factorization.
16254859969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41990400, while the sum is 64.
The spelling of 16254859969 in words is "sixteen billion, two hundred fifty-four million, eight hundred fifty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •