Base | Representation |
---|---|
bin | 111100010010110010110100… |
… | …0010001110001000001000010 |
3 | 2120112210211110020021110012020 |
4 | 1320211211220101301001002 |
5 | 1024003212421134240213 |
6 | 5115542441452542310 |
7 | 216465264602144502 |
oct | 17045455021610102 |
9 | 2515724406243166 |
10 | 530348606165058 |
11 | 143a9264302536a |
12 | 4b595143181996 |
13 | 199c08749a0c45 |
14 | 94d701c0cda02 |
15 | 414a8b71a2923 |
hex | 1e25968471042 |
530348606165058 has 16 divisors (see below), whose sum is σ = 1068439527750240. Its totient is φ = 175492482818336.
The previous prime is 530348606165039. The next prime is 530348606165129. The reversal of 530348606165058 is 850561606843035.
It is a super-2 number, since 2×5303486061650582 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 530348606164992 and 530348606165010.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 322596474948 + ... + 322596476591.
It is an arithmetic number, because the mean of its divisors is an integer number (66777470484390).
Almost surely, 2530348606165058 is an apocalyptic number.
530348606165058 is an abundant number, since it is smaller than the sum of its proper divisors (538090921585182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530348606165058 is a wasteful number, since it uses less digits than its factorization.
530348606165058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645192951681.
The product of its (nonzero) digits is 62208000, while the sum is 60.
The spelling of 530348606165058 in words is "five hundred thirty trillion, three hundred forty-eight billion, six hundred six million, one hundred sixty-five thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •