Base | Representation |
---|---|
bin | 10101011111110111010000… |
… | …01111111101001001110011 |
3 | 20012101101020201001212000111 |
4 | 22233323220033331021303 |
5 | 22144020234434302111 |
6 | 244313303331202151 |
7 | 12646312246422055 |
oct | 1257735017751163 |
9 | 205341221055014 |
10 | 47274306556531 |
11 | 14076a1468130a |
12 | 53760b1746357 |
13 | 204bc429334b2 |
14 | b9613535b8d5 |
15 | 56eaa70cca21 |
hex | 2afee83fd273 |
47274306556531 has 4 divisors (see below), whose sum is σ = 47274396109192. Its totient is φ = 47274217003872.
The previous prime is 47274306556517. The next prime is 47274306556571. The reversal of 47274306556531 is 13565560347274.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 47274306556531 - 29 = 47274306556019 is a prime.
It is a super-2 number, since 2×472743065565312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47274306556571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43979766 + ... + 45041851.
It is an arithmetic number, because the mean of its divisors is an integer number (11818599027298).
Almost surely, 247274306556531 is an apocalyptic number.
47274306556531 is a deficient number, since it is larger than the sum of its proper divisors (89552661).
47274306556531 is an equidigital number, since it uses as much as digits as its factorization.
47274306556531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89552660.
The product of its (nonzero) digits is 63504000, while the sum is 58.
The spelling of 47274306556531 in words is "forty-seven trillion, two hundred seventy-four billion, three hundred six million, five hundred fifty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •