Base | Representation |
---|---|
bin | 101111100001001001111… |
… | …1001000100011111000010 |
3 | 212010100012212122210210110 |
4 | 1133002103321010133002 |
5 | 1324000120331020000 |
6 | 21520120024212150 |
7 | 1242560043553350 |
oct | 137022371043702 |
9 | 25110185583713 |
10 | 6530831501250 |
11 | 209878a1400a1 |
12 | 89587630a056 |
13 | 384b15c04c24 |
14 | 188145a667d0 |
15 | b4d366e0850 |
hex | 5f093e447c2 |
6530831501250 has 640 divisors, whose sum is σ = 20423462400000. Its totient is φ = 1357969536000.
The previous prime is 6530831501239. The next prime is 6530831501251. The reversal of 6530831501250 is 521051380356.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6530831501199 and 6530831501208.
It is not an unprimeable number, because it can be changed into a prime (6530831501251) by changing a digit.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 2878285116 + ... + 2878287384.
It is an arithmetic number, because the mean of its divisors is an integer number (31911660000).
Almost surely, 26530831501250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6530831501250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10211731200000).
6530831501250 is an abundant number, since it is smaller than the sum of its proper divisors (13892630898750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6530831501250 is a wasteful number, since it uses less digits than its factorization.
6530831501250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548 (or 2533 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 6530831501250 in words is "six trillion, five hundred thirty billion, eight hundred thirty-one million, five hundred one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •