Base | Representation |
---|---|
bin | 10101100100100001011001… |
… | …00011100101100100101111 |
3 | 20012221200101112210111021112 |
4 | 22302100230203211210233 |
5 | 22204131040240442341 |
6 | 244515014100022235 |
7 | 12664006550234162 |
oct | 1262205443454457 |
9 | 205850345714245 |
10 | 47434366343471 |
11 | 1412889020a268 |
12 | 53a112139197b |
13 | 20610703a40b3 |
14 | b9db9ab95ad9 |
15 | 573d23e29aeb |
hex | 2b242c8e592f |
47434366343471 has 2 divisors, whose sum is σ = 47434366343472. Its totient is φ = 47434366343470.
The previous prime is 47434366343447. The next prime is 47434366343477. The reversal of 47434366343471 is 17434366343474.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 47434366343471 - 230 = 47433292601647 is a prime.
It is a super-3 number, since 3×474343663434713 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 47434366343471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47434366343477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23717183171735 + 23717183171736.
It is an arithmetic number, because the mean of its divisors is an integer number (23717183171736).
Almost surely, 247434366343471 is an apocalyptic number.
47434366343471 is a deficient number, since it is larger than the sum of its proper divisors (1).
47434366343471 is an equidigital number, since it uses as much as digits as its factorization.
47434366343471 is an evil number, because the sum of its binary digits is even.
The product of its digits is 146313216, while the sum is 59.
The spelling of 47434366343471 in words is "forty-seven trillion, four hundred thirty-four billion, three hundred sixty-six million, three hundred forty-three thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •