Base | Representation |
---|---|
bin | 101000011011010111001… |
… | …1011111000111100100010 |
3 | 201200011211102221200221220 |
4 | 1100312232123320330202 |
5 | 1212013320212313300 |
6 | 15452312100555510 |
7 | 1112300525311230 |
oct | 120665633707442 |
9 | 21604742850856 |
10 | 5556319260450 |
11 | 1852470407a02 |
12 | 758a280b2b96 |
13 | 313c6023020a |
14 | 152cda693950 |
15 | 997ec897da0 |
hex | 50dae6f8f22 |
5556319260450 has 48 divisors (see below), whose sum is σ = 15748196306880. Its totient is φ = 1270015830720.
The previous prime is 5556319260419. The next prime is 5556319260461. The reversal of 5556319260450 is 540629136555.
It is a junction number, because it is equal to n+sod(n) for n = 5556319260393 and 5556319260402.
It is an unprimeable number.
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, 2645865265 + ... + 2645867364.
It is an arithmetic number, because the mean of its divisors is an integer number (328087423060).
Almost surely, 25556319260450 is an apocalyptic number.
5556319260450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5556319260450 is an abundant number, since it is smaller than the sum of its proper divisors (10191877046430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5556319260450 is a wasteful number, since it uses less digits than its factorization.
5556319260450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5291732651 (or 5291732646 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 51.
The spelling of 5556319260450 in words is "five trillion, five hundred fifty-six billion, three hundred nineteen million, two hundred sixty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •