Base | Representation |
---|---|
bin | 100111101011001101001… |
… | …1100100011010010100111 |
3 | 201022021220022011102022211 |
4 | 1033112122130203102213 |
5 | 1203320022044040341 |
6 | 15333010235304251 |
7 | 1101650026655452 |
oct | 117263234432247 |
9 | 21267808142284 |
10 | 5452904674471 |
11 | 1812622593921 |
12 | 7409868ab087 |
13 | 30728c18b8c7 |
14 | 14bcc9d4a499 |
15 | 96c989c4181 |
hex | 4f59a7234a7 |
5452904674471 has 8 divisors (see below), whose sum is σ = 5584972711680. Its totient is φ = 5321505336888.
The previous prime is 5452904674429. The next prime is 5452904674487. The reversal of 5452904674471 is 1744764092545.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5452904674471 - 29 = 5452904673959 is a prime.
It is a super-3 number, since 3×54529046744713 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5452904674271) 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 7 ways as a sum of consecutive naturals, for example, 167158401 + ... + 167191018.
It is an arithmetic number, because the mean of its divisors is an integer number (698121588960).
Almost surely, 25452904674471 is an apocalyptic number.
5452904674471 is a deficient number, since it is larger than the sum of its proper divisors (132068037209).
5452904674471 is a wasteful number, since it uses less digits than its factorization.
5452904674471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334349813.
The product of its (nonzero) digits is 33868800, while the sum is 58.
The spelling of 5452904674471 in words is "five trillion, four hundred fifty-two billion, nine hundred four million, six hundred seventy-four thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •