Base | Representation |
---|---|
bin | 100101000001011010… |
… | …0101100000100000101 |
3 | 21121012210021221110101 |
4 | 1022002310230010011 |
5 | 2300311042331011 |
6 | 100305044124101 |
7 | 5513122033336 |
oct | 1120264540405 |
9 | 247183257411 |
10 | 79504261381 |
11 | 307990a0346 |
12 | 134a9996631 |
13 | 766051255c |
14 | 3bc2db228d |
15 | 2104be82c1 |
hex | 1282d2c105 |
79504261381 has 2 divisors, whose sum is σ = 79504261382. Its totient is φ = 79504261380.
The previous prime is 79504261351. The next prime is 79504261433. The reversal of 79504261381 is 18316240597.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51751700100 + 27752561281 = 227490^2 + 166591^2 .
It is a cyclic number.
It is not a de Polignac number, because 79504261381 - 25 = 79504261349 is a prime.
It is a super-2 number, since 2×795042613812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (79504261351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 39752130690 + 39752130691.
It is an arithmetic number, because the mean of its divisors is an integer number (39752130691).
It is a 1-persistent number, because it is pandigital, but 2⋅79504261381 = 159008522762 is not.
Almost surely, 279504261381 is an apocalyptic number.
It is an amenable number.
79504261381 is a deficient number, since it is larger than the sum of its proper divisors (1).
79504261381 is an equidigital number, since it uses as much as digits as its factorization.
79504261381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 79504261381 in words is "seventy-nine billion, five hundred four million, two hundred sixty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •