Base | Representation |
---|---|
bin | 100100111010000011100… |
… | …1001010101000000101001 |
3 | 122221220221120222201202112 |
4 | 1021310013021111000221 |
5 | 1131101412410344231 |
6 | 14442132522212105 |
7 | 1032321455553620 |
oct | 111640711250051 |
9 | 18856846881675 |
10 | 5072476262441 |
11 | 168625267a215 |
12 | 69b0b6054035 |
13 | 2aa442549663 |
14 | 13771b1d06b7 |
15 | 8be3041e92b |
hex | 49d07255029 |
5072476262441 has 8 divisors (see below), whose sum is σ = 5797131631680. Its totient is φ = 4347824869008.
The previous prime is 5072476262407. The next prime is 5072476262509. The reversal of 5072476262441 is 1442626742705.
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 5072476262441 - 218 = 5072476000297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5072476262441.
It is not an unprimeable number, because it can be changed into a prime (5072476268441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2612255 + ... + 4119323.
It is an arithmetic number, because the mean of its divisors is an integer number (724641453960).
Almost surely, 25072476262441 is an apocalyptic number.
It is an amenable number.
5072476262441 is a deficient number, since it is larger than the sum of its proper divisors (724655369239).
5072476262441 is a wasteful number, since it uses less digits than its factorization.
5072476262441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1987903.
The product of its (nonzero) digits is 4515840, while the sum is 50.
The spelling of 5072476262441 in words is "five trillion, seventy-two billion, four hundred seventy-six million, two hundred sixty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •