Base | Representation |
---|---|
bin | 111100010001111100010000… |
… | …1111010001001010101110011 |
3 | 2120112101122002012211101211112 |
4 | 1320203320201322021111303 |
5 | 1023444303013112413443 |
6 | 5115412545355103535 |
7 | 216453646623412325 |
oct | 17043704172112563 |
9 | 2515348065741745 |
10 | 530231461451123 |
11 | 143a479999799a3 |
12 | 4b5764ab741bab |
13 | 199b27c6200273 |
14 | 94d14a807d615 |
15 | 414780cc07b18 |
hex | 1e23e21e89573 |
530231461451123 has 16 divisors (see below), whose sum is σ = 540662692271616. Its totient is φ = 519816187363200.
The previous prime is 530231461451071. The next prime is 530231461451137. The reversal of 530231461451123 is 321154164132035.
It is a cyclic number.
It is not a de Polignac number, because 530231461451123 - 210 = 530231461450099 is a prime.
It is a super-2 number, since 2×5302314614511232 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (530231461451183) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 376001198 + ... + 377408748.
It is an arithmetic number, because the mean of its divisors is an integer number (33791418266976).
Almost surely, 2530231461451123 is an apocalyptic number.
530231461451123 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
530231461451123 is a deficient number, since it is larger than the sum of its proper divisors (10431230820493).
530231461451123 is a wasteful number, since it uses less digits than its factorization.
530231461451123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413214.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 530231461451123 in words is "five hundred thirty trillion, two hundred thirty-one billion, four hundred sixty-one million, four hundred fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.780 sec. • engine limits •