Base | Representation |
---|---|
bin | 111100000011011101100000… |
… | …0101110000111000110100110 |
3 | 2120021100101000201122122220110 |
4 | 1320012323000232013012212 |
5 | 1023214201100312020410 |
6 | 5111250404001313450 |
7 | 216160112613203232 |
oct | 17006730056070646 |
9 | 2507311021578813 |
10 | 528241261048230 |
11 | 14334a9517054a4 |
12 | 4b2b4841635886 |
13 | 19899c24c8a882 |
14 | 9463028ca75c2 |
15 | 4110b7a1ee720 |
hex | 1e06ec0b871a6 |
528241261048230 has 128 divisors (see below), whose sum is σ = 1273132914393600. Its totient is φ = 140270602106880.
The previous prime is 528241261048169. The next prime is 528241261048309. The reversal of 528241261048230 is 32840162142825.
It is a super-2 number, since 2×5282412610482302 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 528241261048230.
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 40326832221 + ... + 40326845319.
It is an arithmetic number, because the mean of its divisors is an integer number (9946350893700).
Almost surely, 2528241261048230 is an apocalyptic number.
528241261048230 is an abundant number, since it is smaller than the sum of its proper divisors (744891653345370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
528241261048230 is a wasteful number, since it uses less digits than its factorization.
528241261048230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18134.
The product of its (nonzero) digits is 1474560, while the sum is 48.
The spelling of 528241261048230 in words is "five hundred twenty-eight trillion, two hundred forty-one billion, two hundred sixty-one million, forty-eight thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •