Base | Representation |
---|---|
bin | 111101101001001111101… |
… | …1011010000011100001001 |
3 | 1002222221121122200021120200 |
4 | 1323102133123100130021 |
5 | 2102302333124332111 |
6 | 30004051032442413 |
7 | 1533051510505230 |
oct | 173223733203411 |
9 | 32887548607520 |
10 | 8472350230281 |
11 | 2777115916483 |
12 | b49bb8b49409 |
13 | 495c2955b142 |
14 | 2140c763db17 |
15 | ea5ba464256 |
hex | 7b49f6d0709 |
8472350230281 has 24 divisors (see below), whose sum is σ = 13986722817600. Its totient is φ = 4841128079136.
The previous prime is 8472350230273. The next prime is 8472350230291. The reversal of 8472350230281 is 1820320532748.
8472350230281 is a `hidden beast` number, since 8 + 47 + 2 + 350 + 230 + 28 + 1 = 666.
It is not a de Polignac number, because 8472350230281 - 23 = 8472350230273 is a prime.
It is a super-2 number, since 2×84723502302812 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (8472350230271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1548931 + ... + 4398168.
It is an arithmetic number, because the mean of its divisors is an integer number (582780117400).
Almost surely, 28472350230281 is an apocalyptic number.
It is an amenable number.
8472350230281 is a deficient number, since it is larger than the sum of its proper divisors (5514372587319).
8472350230281 is a wasteful number, since it uses less digits than its factorization.
8472350230281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5969725 (or 5969722 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 45.
The spelling of 8472350230281 in words is "eight trillion, four hundred seventy-two billion, three hundred fifty million, two hundred thirty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •