Base | Representation |
---|---|
bin | 100110100100011000110… |
… | …1001101010001010011010 |
3 | 200202202100102222222022101 |
4 | 1031020301221222022122 |
5 | 1143322041044204300 |
6 | 15135055253514014 |
7 | 1054654220034541 |
oct | 115106151521232 |
9 | 20682312888271 |
10 | 5300822647450 |
11 | 1764080212a90 |
12 | 71740294290a |
13 | 2c5b334751c5 |
14 | 1447bdc6b158 |
15 | 92d4722cb6a |
hex | 4d231a6a29a |
5300822647450 has 96 divisors (see below), whose sum is σ = 11312302966272. Its totient is φ = 1830195744000.
The previous prime is 5300822647433. The next prime is 5300822647451. The reversal of 5300822647450 is 547462280035.
It is a self number, because there is not a number n which added to its sum of digits gives 5300822647450.
It is not an unprimeable number, because it can be changed into a prime (5300822647451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2029357 + ... + 3836656.
It is an arithmetic number, because the mean of its divisors is an integer number (117836489232).
Almost surely, 25300822647450 is an apocalyptic number.
5300822647450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5300822647450 is an abundant number, since it is smaller than the sum of its proper divisors (6011480318822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5300822647450 is a wasteful number, since it uses less digits than its factorization.
5300822647450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5866120 (or 5866115 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 46.
The spelling of 5300822647450 in words is "five trillion, three hundred billion, eight hundred twenty-two million, six hundred forty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •